Abstract
This paper presents a new concept of efficient solution for the linear vector maximization problem. Briefly, these solutions are efficient with respect to the constraints, in addition to being efficient with respect to the multiple objectives. The duality theory of linear vector maximization is developed in terms of this solution concept and then is used to formulate the problem as a linear program.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cassidy, R. G., Field, C. A., andSutherland, W. R. S.,Inverse Programming: Theory and Examples, Mathematical Programming, Vol. 4, pp. 297–308, 1973.
Gray, D. F.,Vector-Valued Inverse Programming, Dalhousie University, PhD Thesis, 1977.
Evans, J. P., andSteuer, R. E.,A Revised Simplex Method for Linear Multiple Objective Programs, Mathematical Programming, Vol. 5, pp. 54–72, 1973.
Philip, J.,Algorithms for the Vector Maximization Problem, Mathematical Programming, Vol. 2, pp. 207–229, 1972.
Isermann, H.,Proper Efficiency and the Linear Vector Maximization Problem, Operations Research, Vol. 22, pp. 189–191, 1974.
Geoffrion, A. M.,Proper Efficiency and the Theory of Vector Maximization, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 618–630, 1968.
Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.
Author information
Authors and Affiliations
Additional information
Communicated by O. L. Mangasarian
This research has been partially supported by grants from the Canada Council and the National Research Council of Canada.
Rights and permissions
About this article
Cite this article
Gray, D.F., Sutherland, W.R.S. Inverse programming and the linear vector maximization problem. J Optim Theory Appl 30, 523–534 (1980). https://doi.org/10.1007/BF01686718
Issue Date:
DOI: https://doi.org/10.1007/BF01686718