Abstract
We present a primal method for the solution of the semi-infinite linear programming problem with constraint index setS. We begin with a detailed treatment of the case whenS is a closed line interval in ℝ. A characterization of the extreme points of the feasible set is given, together with a purification algorithm which constructs an extreme point from any initial feasible solution. The set of points inS where the constraints are active is crucial to the development we give. In the non-degenerate case, the descent step for the new algorithm takes one of two forms: either an active point is dropped, or an active point is perturbed to the left or right. We also discuss the form of the algorithm when the extreme point solution is degenerate, and in the general case when the constraint index set lies in ℝp. The method has associated with it some numerical difficulties which are at present unresolved. Hence it is primarily of interest in the theoretical context of infinite-dimensional extensions of the simplex algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.J. Anderson, “A new primal algorithm for semi-infinite linear programming,” in: [2] pp. 108–122.
E.J. Anderson and A.B. Philpott,Infinite Programming, Proceedings (Springer-Verlag, Berlin, 1985).
I.D. Coope and G.A. Watson, “A projected lagrangian algorithm for semi-infinite programming,”Mathematical Programming 32 (1985) 337–356.
P.E. Gill, W. Murray and M. Wright,Practical Optimization (Academic Press, London, 1981).
K. Glashoff, and S.-A. Gustafson,Linear Optimization and Approximation (Springer-Verlag, New York, 1983).
S.-A. Gustafson and K.O. Kortanek, “Numerical treatment of a class of semi-infinite programming problems,”Naval Research Logistics Quarterly 20 (1973) pp. 477–504.
R. Hettich,Semi-Infinite Programming, Proceedings of a Workshop (Springer-Verlag, Berlin, 1979).
R. Hettich, “A comparison of some numerical methods for semi-infinite programming,” in: [7] pp. 112–125.
R. Hettich, “A review of numerical methods for semi-infinite optimization,” in: A.V. Fiacco and K.O. Kortanek, eds.,Semi-Infinite Programming and Applications, Proceedings of an international symposium (Springer-Verlag, Berlin, 1983) pp. 158–178.
R. Hettich, and H.Th. Jongen, “Semi-infinite programming: conditions of optimality and applications,” in: J. Stoer, ed.,Optimization Techniques, Part 2 (Springer-Verlag, Berlin, 1978) pp. 1–11.
H.Th. Jongen and G. Zwier, “On the local structure of the feasible set in semi-infinite optimization,” in: B. Brosowski and F. Deutsch, eds.,Parametric Optimization and Approximations (Birkhauser Verlag, Basel, 1985) pp. 185–202.
A.S. Lewis, “Extreme points and purification algorithms in general linear programming,” in: [2] pp. 123–135.
P. Nash, “Algebraic fundamentals of linear programming,” in: [2] pp. 37–52.
A.F. Perold, “Extreme points and basic feasible solutions in continuous time linear programming,”SIAM Journal on Control and Optimization 19 (1981) pp. 52–63.
K. Roleff, “A stable multiple exchange algorithm for linear SIP,” in: [7] pp. 83–96.
W. Rudin,Real and Complex Analaysis (McGraw-Hill, New York, 1966).
G.A. Watson, “Lagrangian methods for semi-infinite programming problems,” in: [2] pp. 90–107.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Anderson, E.J., Lewis, A.S. An extension of the simplex algorithm for semi-infinite linear programming. Mathematical Programming 44, 247–269 (1989). https://doi.org/10.1007/BF01587092
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01587092