Abstract
In this paper, the problem of moving between extreme points in an abstract linear program is investigated. Certain algebraic characterizations of extreme points are discussed, and a purification algorithm is suggested for finding improved extreme points. The method is shown to be applicable to a family of linear programs including semi-infinite and separably-infinite problems. The relevance of the method to recent work on a primal semi-infinite simplex-type algorithm is discussed, and a procedure for constructing an initial feasible solution for such problems is presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E.J. Anderson: “A Review of Duality Theory for Linear Programming over Topological Vector Spaces”, Journal of Mathematical Analysis and Applications, Dec 1983, pp. 380–392.
E.J. Anderson: “A New Primal Algorithm For Semi-Infinite Linear Programming”, this volume.
E.J. Anderson & P. Nash: “Linear Programming In Infinite Dimensional Spaces”, to appear.
E.J. Anderson, P. Nash & A.F. Perold: “Some Properties of a Class of Continuous Linear Programs”, Siam Journal on Control and Optimization, Sep. 1983, pp. 758–765.
E.J. Anderson & A.B. Philpott: “An Algorithm for a Continuous Version of the Assignment Problem”, in ‘Semi-Infinite Programming and Applications, An International Symposium, Austin, Texas,’ 1981, pp. 108–117.
A. Charnes, P.R. Gribik Se K. Kortanek: “Separably-Infinite Programs”, Zeitschrift fur Operations Research, vol.24, 1980, pp. 33–45.
A. Charnes, K.O. Kortanek & W. Raike: “Extreme Point Solutions in Mathematical Programming: An Opposite Sign Algorithm”, S.R.M No.129, Northwestern University, June 1965.
S.-Å. Gustafson & K.O. Kortanek: “Semi-Infinite Programming and Applications”, in Mathematical Programming: The State Of The Art, Bonn, 1982, pp. 132–157.
R. Hettich: “A Review of Numerical Methods for Semi-Infinite Optimization”, in ‘Semi-Infinite Programming and Applications, An International Symposium, Austin, Texas’, 1981, pp. 158–178.
P. Nash: “Algebraic Fundamentals of Linear Programming”, this volume.
M. Ohtsuka: “Generalized Capacity and Duality Theorem in Linear Programming”, J.Sci. Hiroshima Univ. Ser. A-I 30, 1966, pp. 45–56.
A.F. Perold: “Fundamentals of a Continuous Time Simplex Method”, Stanford University, Department of Operations Research, Ph.D Thesis, 1978.
M.J. Todd: “Solving the Generalized Market Area Problem”, Management Science, Oct. 1978, pp. 1549–1554.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lewis, A.S. (1985). Extreme Points and Purification Algorithms in General Linear Programming. In: Anderson, E.J., Philpott, A.B. (eds) Infinite Programming. Lecture Notes in Economics and Mathematical Systems, vol 259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46564-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-46564-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15996-4
Online ISBN: 978-3-642-46564-2
eBook Packages: Springer Book Archive