A computational procedure is given for finding the minimum of a quadratic function of variables subject to linear inequality constraints. The procedure is analogous to the Simplex Method for linear ...

Concave objective functions which are both piecewise linear and separable are often encountered in a wide variety of management science problems. Provided the constraints are linear, problems of this ...

Eventually linear programming came to be used in everything from manufacturing to diet planning. George Bernard Dantzig was born in Portland, Ore., on Nov. 8, 1914.