×

Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem. (English) Zbl 1114.90109

Summary: In this paper we investigate the asymptotic stability of dynamic, multiple-objective linear programs. In particular, we show that a generalization of the optimal partition stabilizes for a large class of data functions. This result is based on a new theorem about asymptotic sign-solvable systems. The stability properties of the generalized optimal partition are used to address a dynamic version of the nonsubstitution theorem.

MSC:

90C29 Multi-objective and goal programming
91B44 Economics of information

References:

[1] Altman E, Avrachenkov K, Filar J (1999) Asymptotic linear programming and policy improvement for singularly perturbed markov decision processes. Math Methods Oper Res 59(1):97–109 · Zbl 0949.90093
[2] Bernard L (1989) A generalized inverse method for asymptotic linear programming. Math Program 43(1):71–86 · Zbl 0677.90074 · doi:10.1007/BF01582298
[3] Bernard L (1993) An efficient basis update for asymptotic linear programming. Linear Algebra Appl 184:83–102 · Zbl 0796.90039 · doi:10.1016/0024-3795(93)90372-U
[4] Brualdi R, Shader B (1995) Matrices and sign-solvable linear systems. Cambridge University Press, New York · Zbl 0833.15002
[5] Campbell S, Meyer C Jr (1979) Generalized inverses of linear transformations. Fearon Pitman Publishers Inc., Belmont · Zbl 0417.15002
[6] Caron R, Greenberg H, Holder A (2002) Analytic centers and repelling inequalities. Eur J Oper Res 143(2):268–290 · Zbl 1058.90075 · doi:10.1016/S0377-2217(02)00326-0
[7] Chander P (1974) A simple proof of the nonsubstitution theorem. Q J Econ 88:698–701 · Zbl 0291.90012 · doi:10.2307/1881834
[8] Diewart W (1975) The samuelson nonsubstitution theorem and the computation of equilibrium prices. Econometrica 43(1):57–64 · Zbl 0291.90011 · doi:10.2307/1913413
[9] Ehrgott M (2000) Multicriteria optimization. In: Lecture notes in economics and mathematical systems, vol. 491. Springer, Berlin Heidelberg New York · Zbl 0956.90039
[10] Fujimoto T (1987) A simple proof of the nonsubstitution theorem. J Quant Econ 3(1):35–38
[11] Greenberg H (1996–2001) Mathematical programming glossary. http://www-math.cudenver.edu/greenbe/glossary/glossary.html
[12] Grunbaum B (1967) Convex polytopes. Wiley-Interscience, New York · Zbl 0163.16603
[13] Hasfura-Buenaga J, Holder A, Stuart J (2005) The asymptotic optimal partition and extensions of the nonsubstitution theorem. Linear Algebra Appl 394:145–167 · Zbl 1062.90034 · doi:10.1016/j.laa.2004.05.018
[14] Holder A (2001) Partitioning multiple objective solutions with applications in radiotherapy design. Technical report\(\sim\)54, Trinity University Mathematics. Optim Eng (to appear) · Zbl 1170.92324
[15] Jeroslow R (1972) Asymptotic linear programming. Oper Res 21:1128–1141 · Zbl 0283.90030 · doi:10.1287/opre.21.5.1128
[16] Jeroslow R (1973) Linear programs dependent on a single parameter. Discrete Math 6:119–140 · Zbl 0283.90029 · doi:10.1016/0012-365X(73)90042-3
[17] Kuga K (2001) The non-substitution theorem: multiple primary factors and the cost function approach. Technical report discussion paper no. 529, The Institute of Social and Economic Research, Osaka Univeristy, Osaka, Japan
[18] Kurz H, Salvadori N (1995) Theory of production: a long-period analysis. Cambridge University Press, New York
[19] Mirrlees J (1969) The dynamic nonsubstitution theorem. Rev Econ Stud 36(105):67–76 · Zbl 0205.48803 · doi:10.2307/2296343
[20] Roos C, Terlaky T, Vial J-Ph (1997) Theory and algorithms for linear optimization: an interior point approach. Wiley, New York · Zbl 0954.65041
[21] Samuelson P (1951) Abstract of a theorem concerning substitutability in open leontief models. In: Koopmans T (eds). Activity analysis of production and allocation, Chap 7. Wiley, New York · Zbl 0045.09604
[22] Smith A (1991) The wealth of nations. Alfred A. Knopf, Inc., New York
[23] Ying H (1996) A canonical form for pencils of matrices with applications to asymptotic linear programs. Linear Algebra Appl 234:97–123 · Zbl 0841.15007 · doi:10.1016/0024-3795(95)00090-9
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.