Technical Note—A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures

Gary J. Koehler and Surya Kumar
Additional contact information
Gary J. Koehler: University of Florida, Gainesville, Florida
Surya Kumar: University of Florida, Gainesville, Florida

Operations Research, 1980, vol. 28, issue 2, 424-430

Abstract: Subgradient optimization and relaxation are two of the common approaches to finding a point of a polyhedron when conventional procedures like the simplex method are ruled out due perhaps to the size of the problem. In this note we generalize a useful relaxation procedure and show the equivalence of this new procedure with a well known subgradient method.

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.2.424 (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:28:y:1980:i:2:p:424-430

Access Statistics for this article

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