×
Geoffrion, A. M.

Proper efficiency and the theory of vector maximization. (English) Zbl 0181.22806

J. Math. Anal. Appl. 22, 618-630 (1968).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0181.22806

Cited in 6 Reviews
Cited in 598 Documents

Keywords:

operations research
PDF BibTeX XML Cite
\textit{A. M. Geoffrion}, J. Math. Anal. Appl. 22, 618--630 (1968; Zbl 0181.22806)
Full Text: DOI

References:

[1] Berge, C.; Gouila-Houri, A., Programming, Games, and Transportation Networks (1965), Wiley: Wiley New York
[2] Charnes, A.; Cooper, W. W., (Management Models and Industrial Applications of Linear Programming, Vol. 1 (1961), Wiley: Wiley New York) · Zbl 0107.37004
[3] Markowitz, H., The optimization of a quadratic function subject to linear constraints, Naval Res. Logistics Quart., 3, Nos. 1 and 2, 111-133 (March and June 1956)
[4] Geoffrion, A. M., Strictly concave parametric programming. Part II, Managem. Sci., 13, No. 5, 359-370 (January 1967)
[5] Kuhn, H. W.; Tucker, A. W., Nonlinear programming, (Proceedings Second Berkeley Symposium on Mathematical Statistics and Probability (1950), Univ. of California Press: Univ. of California Press Berkeley, California), 481-492 · Zbl 0044.05903
[6] Arrow, K. J.; Barankin, E. W.; Blackwell, D., Admissible points of convex sets, (Kuhn, H. W.; Tucker, A. W., Contributions to the Theory of Games (1953), Princeton Univ. Press: Princeton Univ. Press Princeton, New Jersey), 87-91 · Zbl 0050.14203
[7] Klinger, A., Improper solutions of the vector maximum problem, Operations Res., 15, 570-572 (1967) · Zbl 0171.18101
[8] Karlin, S., (Mathematical Methods and Theory in Games, Programming, and Economics, Vol. I (1959), Addison-Wesley: Addison-Wesley Reading, Massachusetts) · Zbl 0139.12704
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.