The Bounding Hyperplane Method of Linear Programming

C. P. Saksena and A. J. Cole
Additional contact information
C. P. Saksena: University of St. Andrews, Scotland
A. J. Cole: University of St. Andrews, Scotland

Operations Research, 1971, vol. 19, issue 1, 1-18

Abstract: This paper describes a new method for solving a general linear programming problem.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.1 (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:19:y:1971:i:1:p:1-18

Access Statistics for this article

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