Abstract
Least element theory is extended, for linear problems, to general multiple-objective problems, and the pre-Leontief matrix and left-hand matrix inverse notions are generalized.
Similar content being viewed by others
References
Gabbay, H.,A Note on Polyhedral Sets Having a Least Element, Mathematical Programming, Vol. 11, pp. 94–96, 1976.
Cottle, R. W., andVeinott, A. F.,Polyhedral Sets Having Least Elements, Mathematical Programming, Vol. 3, pp. 238–249, 1972.
Mangasarian, O. L.,Characterization of Real Matrices of a Monotone Kind, SIAM Review, Vol. 10, pp. 437–441, 1968.
Birkhoff, G.,Lattice Theory, American Mathematical Society, Providence, Rhode Island, 1979.
White, D. J.,Optimality and Efficiency, John Wiley, New York, New York, 1982.
Koehler, G. J., Whinston, A. B., andWright, G. P.,The Solution of Leontief Substitution Systems Using Matrix Iterative Techniques, Management Science, Vol. 21, pp. 1295–1302, 1975.
Mangasarian, O. L.,Nonlinear Programming, McGraw Hill, New York, New York, 1969.
Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1972.
Stoer, J., andWitzgall, C.,Convexity and Optimization in Finite Dimensions, Vol. 1, Springer, New York, New York, 1970.
Author information
Authors and Affiliations
Additional information
Communicated by P. L. Yu
This work was completed while the author was visiting the Center for Advanced Studies and the Department of Systems Engineering at the University of Virginia. The author is indebted to the referees for their helpful comments.
Rights and permissions
About this article
Cite this article
White, D.J. Least elements revisited. J Optim Theory Appl 65, 117–128 (1990). https://doi.org/10.1007/BF00941163
Issue Date:
DOI: https://doi.org/10.1007/BF00941163