Extreme Point Mathematical Programming

M. J. L. Kirby, H. R. Love and Kanti Swarup
Additional contact information
M. J. L. Kirby: Dalhousie University
H. R. Love: University of Prince Edward Island
Kanti Swarup: University of Delhi

Management Science, 1972, vol. 18, issue 9, 540-549

Abstract: The paper considers a class of optimization problems. The problems are linear programming problems: maximize cx subject to Ax = b with the additional constraint that x must also be an extreme point of a second convex polyhedron Dx = d, x \geqq 0. A cutting-plane algorithm for solving such problems is presented. Two numerical examples are also included.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.9.540 (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:18:y:1972:i:9:p:540-549

Access Statistics for this article

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