Abstract
In this paper a new class of generalized vector-valued arcwise connected functions, termed sub-arcwise connected functions, is introduced. The properties of sub-arcwise connected functions are derived. The approximate quasi efficient solutions of vector optimization problems are studied, and the necessary and sufficient optimality conditions are obtained under the assumption of arcwise connectivity. An approximate Mond-Weir type dual problem is formulated and the duality theorems are established.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Avriel M., Zang I.: Generalized arcwise connected functions and characterization of local-global minimum properties. J. Optim. Theory Appl. 32, 407–425 (1980)
Bhatia D., Mehra A.: Optimality conditions and duality inuvolving arcwise connected and generalized arcwise connected functions. J. Optim. Theory Appl. 100, 181–194 (1999)
Carven B.D.: Mathematics Programming and Control Theory. Chapman and Hall, London (1978)
Dutta J.: Necessary optimality conditions and saddle points for approximate optimization in Banach spaces. Top 13, 127–143 (2005)
Dutta J., Vetrivel V.: On approximate minima in vector optimization. Numer. Funct. Anal. Optim. 22, 845–859 (2001)
Fu J.Y., Wang H.: Arcwise connected cone-convex functions and mathematical programming. J. Optim. Theory Appl. 118, 339–352 (2003)
Gutiérrez C., Loépez R., Novo V.: Generalized ε-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions. Nonlinear Anal. 72, 4331–4346 (2010)
Helbig, S.: On a New Concept for ε-Efficiency. talk at “Optimization Days 1992”, Montreal (1992)
Jahn J.: Mathematical Vector Optimization in Partially-Ordered Linear Spaces. Peter Lang, Frankfurt am Main (1986)
Jeyakumar V.: Convexlike alternative theorems and mathematical programming. Optimization 16, 643–652 (1985)
Kutateladze S.S.: Convex ε-programming. Soviet Math. Dokl. 20, 391–393 (1979)
Liu, C.P., Yang, X.M., Lee, H.W.J.: Lagrange multiplier rules for approximate solutions in vector optimization. submitted to J. Math. Anal. Appl.
Loridan P.: Necessary conditions for ε-optimality. Math. Program. Stud. 19, 140–152 (1982)
Loridan P.: ε-solutions in vector minimization problems. J. Optim. Theory Appl. 43, 265–276 (1984)
Mukherjee R.N., Yadav S.R.: A note on arcwise connected sets and functions. B. Aust. Math. Soc. 31, 369–375 (1985)
Németh A.B.: A nonconvex vector minimization problem. Nonlinear Anal. 10, 669–678 (1986)
Ortega J.M., Rheinboldt W.C.: Iterative Solutions of Nonlinear Equations in Several Variables. Academic Press, New York (1970)
Singh G.: Elementary properties of arcwise connected sets and functions. J. Optim. Theory Appl. 41, 377–387 (1983)
Suneja S.K., Aggarwal S., Davar S.: Generalized connected functions with respect to cones. J. Optim Theory Appl. 106, 399–410 (2000)
Tanaka T.: A new approach to approximation of solutions in vector optimization problems. In: Fushimi, M., Tone, K. (eds) Proceedings of APORS, pp. 497–504. World Scientific Publishing, Singapore (1995)
White D.J.: Epsilon efficiency. J. Optim. Theory Appl. 49, 319–337 (1986)
Zhang Q.X.: Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions. J. Glob. Optim. 45, 615–629 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, C.P., Lee, H.W.J. & Yang, X.M. Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity. Optim Lett 6, 1613–1626 (2012). https://doi.org/10.1007/s11590-011-0352-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-011-0352-9