J. C. Dickson
- 1 DANTZIG, G. B. Maximization of a linear function of variables subject to linear inequalities, Chapter XXI of Koopman's Activity Analysis of Production and Allocation, Cowles Commission Monograph 13 (John Wiley & Sons, Inc, New York, 1951).Google Scholar
- 2 GASS, S. L. Linear Programming (McGraw Hill Book Company Inc., New York, 1958).Google Scholar
- 3 LUCE, R. D. RAIFFA, H. Games and Decisions, Appendices 3 and 4 (John Wiley & Sons, Inc., New York, 1957).Google Scholar
Recommendations
On linear programming relaxations for solving polynomial programming problems
Highlights- Theoretically compared the tightness of the J-set relaxation with the recursive McCormick relaxations.
AbstractThis paper studies linear programming (LP) relaxations for solving polynomial programming problems. A polynomial programming problem can be equivalently formulated as a quadratically constrained quadratic program (QCQP) by introducing ...
A simplex algorithm for piecewise-linear programming I: Derivation and proof
The simplex method for linear programming can be extended to permit the minimization of any convex separable piecewise-linear objective, subject to linear constraints. This three-part paper develops and analyzes a general, computationally practical ...
Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
The bilevel programming problems are useful tools for solving the hierarchy decision problems. In this paper, a genetic algorithm based on the simplex method is constructed to solve the linear-quadratic bilevel programming problem (LQBP). By use of Kuhn-...
Comments