Convex Programming by Tangential Approximation

H. O. Hartley and R. R. Hocking
Additional contact information
H. O. Hartley: Iowa State University, Ames
R. R. Hocking: Iowa State University, Ames

Management Science, 1963, vol. 9, issue 4, 600-612

Abstract: This paper describes an algorithm for the solution of the convex programming problem using the simplex method. The algorithm is computationally very simple, requiring the solution of a single linear programming problem which can be accomplished with only slight modification of existing computer codes for the revised simplex method.

Date: 1963
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.9.4.600 (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:ormnsc:v:9:y:1963:i:4:p:600-612

Access Statistics for this article

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