Hostname: page-component-89b8bd64d-z2ts4 Total loading time: 0 Render date: 2026-05-08T09:57:48.070Z Has data issue: false hasContentIssue false
  • English
  • Français

Saddle point criteria and duality in multiobjective programming via an η-approximation method

Published online by Cambridge University Press:  17 February 2009

Tadeusz Antczak
Tadeusz Antczak
Affiliation:
Faculty of Mathematics, University of Łódź, Banacha 22, 90-238 Łódź, Poland; e-mail: antczak@math.uni.lodz.pl.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, Antczak's η-approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the η-saddle points of the associated η-approximated vector optimisation problems. We introduce an η-Lagrange function for a constructed η-approximated vector optimisation problem and present some modified η-saddle point results. Furthermore, we construct an η-approximated Mond-Weir dual problem associated with the original dual problem of the considered multiobjective programming problem. Using duality theorems between η-approximation vector optimisation problems and their duals (that is, an η-approximated dual problem), various duality theorems are established for the original multiobjective programming problem and its original Mond-Weir dual problem.

Information

Type
Research Article
Information
The ANZIAM Journal , Volume 47 , Issue 2 , October 2005 , pp. 155 - 172
Copyright
Copyright © Australian Mathematical Society 2005

References

[1]Antczak, T., “A new approach to multiobjective programming with a modified objective function”, J. Global Optim. 27 (2003) 485–495.CrossRefGoogle Scholar
[2]Antczak, T., “An η-approximation approach for nonlinear mathematical programming problems involving invex functions”, Numer Funct. Anal. Optim. 25 (2004) 423–438.Google Scholar
[3]Antczak, T., “An η-approximation method in vector optimization”, Nonlinear Anal. 63 (2005) 225–236.CrossRefGoogle Scholar
[4]Bazaraa, M. S., Sherali, H. D. and Shetty, C. M., Nonlinear programming: theory and algorithms (John Wiley and Sons, New York, 1991).Google Scholar
[5]Bector, C. R., Chandra, S. and Durgaprasad, M. V., “Duality in pseudolinear multiobjective programming”, Asia-Pac. J. Oper Res. 5 (1988) 150–159.Google Scholar
[6]Craven, B. D., “Invex functions and constrained local minima”, Bull. Austral. Math. Soc. 24 (1981) 357–366.CrossRefGoogle Scholar
[7]Craven, B. D., “Quasimin and quasisaddlepoint for vector optimization”, Numer Fund. Anal. Optim. 11 (1990) 45–54.CrossRefGoogle Scholar
[8]Egudo, R. R. and Hanson, M. A., “Multi-objective duality with invexity”, J. Math. Anal. Appl. 126 (1987) 469–477.CrossRefGoogle Scholar
[9]Giorgi, G. and Guerraggio, A., “The notion of invexity in vector optimization: smooth and non-smooth case”, in Generalized Convexity, Generalized Monotonicity (eds. Crouzeix, J. P., Martinez-Legaz, J. E. and Volle, M.), Proceedings of the Fifth Symposium on Generalized Convexity, Luminy, France, (Kluwer, Dordrecht, 1997).Google Scholar
[10]Gulati, T. R. and Talaat, N., “Duality in nonconvex vector minimum problems”, Bull. Austral. Math. Soc. 44 (1991) 501–509.CrossRefGoogle Scholar
[11]Hanson, M. A., “On sufficiency of the Kuhn-Tucker conditions”, J. Math. Anal. Appl. 80 (1981) 545–550.CrossRefGoogle Scholar
[12]Kim, D. S., “Optimality conditions and duality theorems for multiobjective invex programs”, J. Inform. Optim. Sci. 12 (1991) 235–242.Google Scholar
[13]Luc, D. T., Theory of vector optimization, Lecture Notes in Economics and Mathematical Systems 319 (Springer-Verlag, Berlin, New York, 1989).CrossRefGoogle Scholar
[14]Mond, B. and Weir, T.. “Generalized concavity and duality”, in Generalized concavity in optimization and economics (eds. Schaible, S. and Ziemba, W. T.), (Academic Press, New York, 1981) 263–279.Google Scholar
[15]Pareto, V., Course d'economie politique (Rouge, Lausanne, 1896).Google Scholar
[16]Singh, C., “Duality theory in multiobjective differentiable programming”, J. Inform. Optim. Sci. 9 (1988) 231–240.Google Scholar
[17]Singh, C., “Optimality conditions in multiobjective differentiable programming”, J. Optim. Theory Appl. 53 (1988) 115–123.CrossRefGoogle Scholar
[18]Weir, T., “Proper efficiency and duality for vector valued optimization problems”, J. Austral. Math. Soc. Ser. A 43 (1987) 21–34.Google Scholar
[19]Weir, T., Mond, B. and Craven, B. D., “On duality for weakly minimized vector valued optimization problems”, Optimization 17 (1986) 711–721.Google Scholar
[20]Weir, T. and Mond, B., “Pre-invex functions in multiple objective optimization”, J. Math. Anal. Appl. 136 (1988) 29–38.CrossRefGoogle Scholar