Abstract
We consider the class of linear programs with infinitely many variables and constraints having the property that every constraint contains at most finitely many variables while every variable appears in at most finitely many constraints. Examples include production planning and equipment replacement over an infinite horizon. We form the natural dual linear programming problem and prove strong duality under a transversality condition that dual prices are asymptotically zero. That is, we show, under this transversality condition, that optimal solutions are attained in both primal and dual problems and their optimal values are equal. The transversality condition, and hence strong duality, is established for an infinite horizon production planning problem.
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 and P. Nash,Linear Programming in Infinite-dimensional Spaces (Wiley, New York, 1987).
J.C. Bean and R.L. Smith, “Conditions for the existence of planning horizons,”Mathematics of Operations Research 9 (1984) 391–401.
A. Ben-Israel, A. Charnes and K. Kortanek, “Duality and asymptotic solvability over cones,”Bulletin of the American Mathematical Society 75 (1969) 318–324.
C. Bès and S. Sethi, “Concepts of forecast and decision horizons: Applications to dynamic stochastic optimization problems,”Mathematics of Operations Research 13 (1988) 295–310.
J.M. Borwein, “Direct theorems in semi-infinite convex programming,”Mathematical Programming 21 (1981) 301–318.
J.M. Borwein, “Semi-infinite programming duality: How special is it?,” in: A.V. Fiacco and K.O. Kortanek, eds,Semi-Infinite Programming and Applications (Springer, Berlin, 1983).
A. Charnes, W.W. Cooper and K.O. Kortanek, “Duality in semi-infinite programs and some works of Haar and Caratheodory,”Management Science 9 (1963) 209–228.
A. Charnes, P.R. Gribek and K.O. Kortanek, “Separably Infinite Programs,”Zeitschrift für Operations Research 24 (1980) 33–45.
E.V. Denardo,Dynamic Programing: Models and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1982).
R.J. Duffin, “Infinite programs,” in: H.W. Kuhn and A.W. Tucker, eds,Linear Inequalities and Related Systems (Princeton Univeristy Press, Princeton, NJ, 1956).
R.J. Duffin, R.G. Jeroslow and L.A. Karlovitz, “Duality in semi-infinite linear programming,” in: A.V. Fiacco and K.O. Kortanek, eds,Semi-Infinite Programming and Applications (Springer, Berlin, 1983).
R.J. Duffin and L.A. Karlovitz, “An infinite linear program with a duality gap,”Management Science 12 (1965) 122–134.
J. Evers,Linear Programming over an Infinite Horizon (Tilburg University Press, Tilburg, Netherlands, 1973).
J. Evers, “A duality theory for infinite horizon optimization of concave input/output processes,”Mathematics of Operations Research 8 (1983) 479–497.
R. Grinold, “Infinite horizon programs,”Management Science 18 (1971) 157–170.
R. Grinold, “Finite horizon approximations of infinite horizon linear programs,”Mathematical Programming 12 (1977) 1–17.
R. Grinold, “Convex infinite horizon programs,”Mathematical Programming 25 (1983) 64–82.
R. Grinold and D.S.P. Hopkins, “Computing optimal solutions for infinite horizon mathematical programs with a transient stage,”Operations Research 21 (1972) 179–187.
D.S.P. Hopkins, “Infinite horizon optimality in an equipment replacement and capacity expansion model,”Management Science 18 (1971) 145–156.
P. Jones, J. Zydiak and W. Hopp, “Stationary dual prices and depreciation,”Mathematical Programming 41 (1988) 357–366.
J.F. Karney, “Duality gaps in semi-infinite linear programming: An approximation problem,”Mathematical Programming 20 (1981) 129–143.
D.G. Luenberger,Optimization by Vector Space Methods (Wiley, New York, 1969).
J. Ponstein,Approaches to the Theory of Optimization (Cambridge University Press, Cambridge, 1980).
I.E. Schochetman and R.L. Smith, “Infinite horizon optimization”,Mathematics of Operations Research 14 (1989) 559–574.
I.E. Schochetman and R.L. Smith, “Finite dimensional approximation in infinite dimensional programming,” to appear in:Mathematical Programming (1992).
Author information
Authors and Affiliations
Additional information
This material is based on work supported by the National Science Foundation under Grant No. ECS-8700836.
Rights and permissions
About this article
Cite this article
Romeijn, H.E., Smith, R.L. & Bean, J.C. Duality in infinite dimensional linear programming. Mathematical Programming 53, 79–97 (1992). https://doi.org/10.1007/BF01585695
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585695