Extreme Point Mathematical Programming

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.

MoreLess

Year of publication:	1972
Authors:	Kirby, M. J. L. ; Love, H. R. ; Swarup, Kanti
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 18.1972, 9, p. 540-549
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.18.9.540 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009214064