×

Sufficiency and duality in multiobjective programming under generalized type I functions. (English) Zbl 1154.90014

This research work represents a significant contribution in the finite dimensional multiobjective programming. The authors introduce and apply new classes of generalized convex functions in the study of differentiable multiobjective programs, using selected references.
Reviewer’s remark: The study can be extended to infinite dimensional spaces.

MSC:

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

References:

[1] Hanson, M.A.: On sufficiency of the Kuhn-Tucker conditions. J. Math. Anal. Appl. 80, 545–550 (1981) · Zbl 0463.90080 · doi:10.1016/0022-247X(81)90123-2
[2] Hanson, M.A., Mond, B.: Necessary and sufficient conditions in constrained optimization. Math. Program. 37, 51–58 (1987) · Zbl 0622.49005 · doi:10.1007/BF02591683
[3] Rueda, N.G., Hanson, M.A.: Optimality criteria in mathematical programming involving generalized invexity. J. Math. Anal. Appl. 130, 375–385 (1988) · Zbl 0647.90076 · doi:10.1016/0022-247X(88)90313-7
[4] Kaul, R.N., Suneja, S.K., Srivastava, M.K.: Optimality criteria and duality in multiobjective optimization involving generalized invexity. J. Optim. Theory Appl. 80, 465–482 (1994) · Zbl 0797.90082 · doi:10.1007/BF02207775
[5] Bector, C.R., Suneja, S.K., Gupta, S.: Univex functions and Univex nonlinear programming. In: Proceedings of the Administrative Sciences Association of Canada, pp. 115–124 (1992) · Zbl 0802.90092
[6] Bector, C.R., Singh, C.: B-vex functions. J. Optim. Theory Appl. 71, 237–253 (1991) · Zbl 0793.90069 · doi:10.1007/BF00939919
[7] Rueda, N.G., Hanson, M.A., Singh, C.: Optimality and duality with generalized convexity. J. Optim. Theory Appl. 86, 491–500 (1995) · Zbl 0838.90114 · doi:10.1007/BF02192091
[8] Aghezzaf, B., Hachimi, M.: Generalized invexity and duality in multiobjective programming problems. J. Glob. Optim. 18, 91–101 (2000) · Zbl 0970.90087 · doi:10.1023/A:1008321026317
[9] Preda, V.: On efficiency and duality for multiobjective programs. J. Math. Anal. Appl. 166, 265–377 (1992) · Zbl 0764.90074 · doi:10.1016/0022-247X(92)90303-U
[10] Hanson, M.A., Mond, B.: Further generalizations of convexity in mathematical programming. J. Inf. Optim. Sci. 3, 25–32 (1986) · Zbl 0475.90069
[11] Vial, J.P.: Strong and weak convexity of sets and functions. Math. Oper. Res. 8, 231–259 (1983) · Zbl 0526.90077 · doi:10.1287/moor.8.2.231
[12] Gulati, T.R., Islam, M.A.: Sufficiency and duality in multiobjective programming involving generalized F-convex functions. J. Math. Anal. Appl. 183, 181–195 (1994) · Zbl 0824.90118 · doi:10.1006/jmaa.1994.1139
[13] Ahmad, I.: Sufficiency and duality in multiobjective programming with generalized (F,{\(\rho\)})-convexity. J. Appl. Anal. 11, 19–33 (2005) · Zbl 1140.90484 · doi:10.1515/JAA.2005.19
[14] Liang, Z.A., Huang, H.X., Pardalos, P.M.: Optimality conditions and duality for a class of nonlinear fractional programming problems. J. Optim. Theory Appl. 110, 611–619 (2002) · Zbl 1064.90047 · doi:10.1023/A:1017540412396
[15] Hachimi, M., Aghezzaf, B.: Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions. J. Math. Anal. Appl. 296, 382–392 (2004) · Zbl 1113.90142 · doi:10.1016/j.jmaa.2003.12.042
[16] Hanson, M.A., Pini, R., Singh, C.: Multiobjective programming under generalized type I invexity. J. Math. Anal. Appl. 261, 562–577 (2002) · Zbl 0983.90057 · doi:10.1006/jmaa.2001.7542
[17] Suneja, S.K., Srivastava, M.K.: Optimality and duality in nondifferentiable multiobjective optimization involving d-type I and related functions. J. Math. Anal. Appl. 206, 465–479 (1997) · Zbl 0872.90081 · doi:10.1006/jmaa.1997.5238
[18] Jeyakumar, V., Mond, B.: On generalized convex mathematical programming. J. Aust. Math. Soc. Ser. B 34, 43–53 (1992) · Zbl 0773.90061 · doi:10.1017/S0334270000007372
[19] Miettinen, K.M.: Nonlinear Multiobjective Optimization. Kluwer Academic, Boston (1999)
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.