×

Optimality criteria and duality in multiple-objective optimization involving generalized invexity. (English) Zbl 0797.90082

Summary: A multiple-objective optimization problem involving generalized invex functions is considered. Kuhn-Tucker type necessary and sufficient conditions are obtained for a feasible point to be an efficient or properly efficient solution. Two dual programs are obtained. The results are given under weaker invesity assumptions.

MSC:

90C29 Multi-objective and goal programming
Full Text: DOI

References:

[1] Hanson, M. A.,On Sufficiency of the Kuhn-Tucker Conditions, Journal of Mathematical Analysis and Applications, Vol. 80, pp. 545–550, 1981. · Zbl 0463.90080 · doi:10.1016/0022-247X(81)90123-2
[2] Kaul, R. N., andKaur, S.,Optimality Criteria in Nonlinear Programming Involving Nonconvex Functions, Journal of Mathematical Analysis and Applications, Vol. 105, pp. 104–112, 1985. · Zbl 0553.90086 · doi:10.1016/0022-247X(85)90099-X
[3] Hanson, M. A., andMond, B.,Necessary and Sufficient Conditions in Constrained Optimization, Report M683, Department of Statistics, Florida State University, Tallahassee, Florida, 1984.
[4] Rueda, N. G., andHanson, M. A.,Optimality Criteria in Mathematical Programming Involving Generalized Invexity, Journal of Mathematical Analysis and Applications, Vol. 130, pp. 375–385, 1988. · Zbl 0647.90076 · doi:10.1016/0022-247X(88)90313-7
[5] Weir, T.,A Note on Invex Functions and Duality in Multiple-Objective Optimization, Opsearch, Vol. 25, pp. 98–104, 1988. · Zbl 0655.90077
[6] Egudo, R. R.,Efficiency and Generalized Convex Duality for Multiobjective Programs, Journal of Mathematical Analysis and Applications, Vol. 138, pp. 84–94, 1989. · Zbl 0686.90039 · doi:10.1016/0022-247X(89)90321-1
[7] Geoffrion, A. M.,Proper Efficiency and Theory of Vector Maximization, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 618–630, 1968. · Zbl 0181.22806 · doi:10.1016/0022-247X(68)90201-1
[8] Weir, T., andMond, B.,Generalized Convexity and Duality in Multiple-Objective Programming, Bulletin of the Australian Mathematical Society, Vol. 39, pp. 287–299, 1989. · Zbl 0651.90083 · doi:10.1017/S000497270000277X
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.