A method is presented for the generation of extreme points of regions in the parameter space for which a certain basic solution is optimal. It is shown that for any extreme point the inequalities which determine the adjacent regions are easily generated. A numerical example is worked out in detail.

This paper considers the consequences of errors in the cost function which underlies linear decision rules generally and in particular those developed by Holt, c.s., for the paint factory case. By differentiating the decision rules with respect to the various cost coefficients expressions for...

The optimal composition of cattle feed, which can be formulated as a linear programming problem in the case of certainty, is considered when compositions of inputs vary. In the corresponding linear programming formulation the coefficients of the constraints are not constant but can be considered...

The article describes a procedure to maximize a strictly concave quadratic function subject to linear constraints in the form of inequalities. First the unconstrained maximum is considered; when certain constraints are violated, maximization takes place subject to each of these in equational...

A method is given for maximizing a linear function subject to a quadratic and a number of linear constraints. The method differs from general convex programming methods by terminating in a finite number of iterations and is actually an application of the Simplex and dual methods for quadratic...