Abstract
First order and second order characterizations of pseudolinear functions are derived. For a nonlinear programming problem involving pseudolinear functions only, it is proved that every efficient solution is properly efficient under some mild conditions.
Similar content being viewed by others
References
M. Avriel and S. Schaible, “Second order characterizations of pseudoconvex functions”,Mathematical Programming 14 (1978) 170–185.
A. Charnes and W.W. Cooper, “Programming with linear fractional functionals”,Naval Research Logistics Quarterly 19 (1962) 181–186.
E.U. Choo, “Multicriteria linear fractional programming”, Ph.D. thesis, University of British Columbia (1980).
E.U. Choo, “Proper efficiency and linear fractional vector maximum problem”,Operations Research, to appear.
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
W.E. Diewert, M. Avriel and I. Zang, “Nine kinds of quasiconcavity and concavity”,Journal of Economic Theory 25 (1981) 397–420.
J.G. Ecker and I. A. Kouada, “Finding all efficient extreme points for multiple objective linear programs”,Mathematical Programming 14 (1978) 249–261.
A.M. Geoffrion, “Proper efficiency and the theory of vector maximization”,Journal of Mathematical Analysis and Applications 22 (1968) 618–630.
H. Isermann, “Proper efficiency and the linear vector maximum problem”,Operations Research 22 (1974) 189–191.
S.H. Kornbluth and R.E. Steuer, “Multiple objective linear fractional programming”,Management Science 27 (1981) 1024–1039.
K.O. Kortanek and J.P. Evans, “Pseudo-concave programming and Lagrange regularity”,Operations Research 15 (1967) 882–892.
O.L. Mangasarian, “Pseudo-convex functions”,Society for Industrial and Applied Mathematics Journal on Control 3 (1965) 281–290.
O.L. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969).
J. Philip, “Algorithms for the vector maximization problem”,Mathematical Programming 2 (1972) 207–229.
S. Tigan, “Sur le problème de la programmation vectorielle fractionnaire”,Mathematica-Revue d'Analyse Numérique et de Théorie de l'Approximation 4 (1975) 99–103.
R. Weber, “Pseudomonotonic multiobjective programming”, Discussion Paper, Institute of Operations Research, University of Saarland, W. Germany (August 1982).
P.L. Yu and M. Zeleny, “The set of all nondominated solutions in linear cases and a multicriteria simplex method”,Journal of Mathematical Analysis and Applications 49 (1975) 430–468.
M. Zeleny, Linear multiobjective programming (Springer, Berlin, 1974).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chew, K.L., Choo, E.U. Pseudolinearity and efficiency. Mathematical Programming 28, 226–239 (1984). https://doi.org/10.1007/BF02612363
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02612363