Extreme Point Mathematical Programming

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1972 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Management Science, volume 18, pages 540-549 (issn: 0025-1909, eissn: 1526-5501,

Copyright policy )

Authors: M. J. L. Kirby; H. R. Love; Kanti Swarup;

doi: 10.1287/mnsc.18.9.540

Extreme Point Mathematical Programming

- Summary
- Subjects
- Metrics

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 ≧ 0. A cutting-plane algorithm for solving such problems is presented. Two numerical examples are also included.

Related Organizations

Dalhousie University
Canada
University of Prince Edward Island
Canada
University of Delhi
India

Keywords

Software, source code, etc. for problems pertaining to operations research and mathematical programming, Linear programming, Integer programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	20
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average