This is a preview. Log in through your library . Abstract A computational procedure based on the results of Barankin and Dorfman [1], for minimising a convex quadratic function subject to linear ...
DUBLIN--(BUSINESS WIRE)--Research and Markets(http://www.researchandmarkets.com/research/799091/deterministic_oper) has announced the addition of John Wiley and Sons ...
George Bernard Dantzig, a Stanford University mathematics professor for three decades whose groundbreaking Simplex Algorithm has been used by industry to find the most efficient means to manufacture ...
SIAM Journal on Numerical Analysis, Vol. 13, No. 1 (Mar., 1976), pp. 145-154 (10 pages) A numerically stable form of an algorithm that is closely related to the work of Gill and Murray [5] and Conn [3 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results