×

zbMATH — the first resource for mathematics

Algorithms for the vector maximization problem. (English) Zbl 0288.90052

MSC:
90C05 Linear programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] R. Benayoun and J. Tergny, ”Critères multiples en programmation mathématique: une solution dans le cas linéaire,”Revue Française d’Information et de Recherche Operationelle 5 (1969) 31–56. · Zbl 0187.17501
[2] P. Bod, ”Linear optimization with several simultaneously gíven objective functions (in Hungarian),”Publications of the Mathematical Institute of the Hungarian Academy of Sciences 8, B, Fasc. 4 (1963).
[3] A. Charnes and W.W. Cooper, ”Management models and industrial applications of linear programming,”Management Science 4 (1957) 39–92. · Zbl 0995.90552 · doi:10.1287/mnsc.4.1.38
[4] A. Charnes and W.W. Cooper,Management models and industrial applications of linear programming, Vols. I and II (Wiley, New York, 1969). · Zbl 0194.20001
[5] A.M. Geoffrion, ”Proper efficiency and the theory of vector maximization,”Journal of Mathematical Analysis and Applications 22 (1968) 618–630. · Zbl 0181.22806 · doi:10.1016/0022-247X(68)90201-1
[6] Activity analysis of production and allocation, Ed. T.C. Koopmans (Wiley, New York, 1951). · Zbl 0045.09503
[7] H.W. Kuhn and A.W. Tucker, ”Nonlinear programming,”Proceedings of the second Berkeley symposium on mathematical statistics and probability (University of California Press, Berkeley, California, 1951) pp. 481–492.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.