Abstract
We consider a convex setB inR n described as the intersection of halfspacesa i T x ≦b i (i ∈ I) and a set of linear objective functionsf j =c j T x (j ∈ J). The index setsI andJ are allowed to be infinite in one of the algorithms. We give the definition of theefficient points ofB (also called functionally efficient or Pareto optimal points) and present the mathematical theory which is needed in the algorithms. In the last section of the paper, we present algorithms that solve the following problems:
-
I.
To decide if a given point inB is efficient.
-
II.
To find an efficient point inB.
-
III.
To decide if a given efficient point is the only one that exists, and if not, find other ones.
-
IV.
The solutions of the above problems do not depend on the absolute magnitudes of thec j. They only describe the relative importance of the different activitiesx i. Therefore we also consider
$$\begin{gathered} \max G^T x \hfill \\ x efficient \hfill \\ \end{gathered} $$for some vectorG.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
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.
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).
A. Charnes and W.W. Cooper, “Management models and industrial applications of linear programming,”Management Science 4 (1957) 39–92.
A. Charnes and W.W. Cooper,Management models and industrial applications of linear programming, Vols. I and II (Wiley, New York, 1969).
A.M. Geoffrion, “Proper efficiency and the theory of vector maximization,”Journal of Mathematical Analysis and Applications 22 (1968) 618–630.
Activity analysis of production and allocation, Ed. T.C. Koopmans (Wiley, New York, 1951).
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Philip, J. Algorithms for the vector maximization problem. Mathematical Programming 2, 207–229 (1972). https://doi.org/10.1007/BF01584543
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584543