New Methods in Mathematical Programming---Some Simplex-Like Nonlinear Programming Procedures

Philip Wolfe
Additional contact information
Philip Wolfe: The Rand Corporation, Santa Monica, California

Operations Research, 1962, vol. 10, issue 4, 438-447

Abstract: This paper surveys certain recent procedures for the computational solution of convex nonlinear programming problems, related to one another through being based on the simplex method of linear programming. The first procedure, the simplex method for quadratic programming , is a terminating algorithm for the extremization of a quadratic function under linear constraints. The next two procedures employ efficient techniques for the development of a grid on which nonlinear objectives and constraints can be represented by linear functions, the separable programming method is applicable to problems involving separable functions, and the decomposition method to those in which a simpler subproblem can readily be solved. Finally, the cutting-plane method employs an efficient sequential means of approximating to the nonlinear functions involved through first-order Taylor's series approximations.

Date: 1962
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.10.4.438 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:10:y:1962:i:4:p:438-447

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().