Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-20T07:13:45.761Z Has data issue: false hasContentIssue false

Unified duality for vector optimization problem over cones involving support functions

Published online by Cambridge University Press:  21 March 2014

Surjeet Kaur Suneja
Affiliation:
Department of Mathematics, Miranda House, University of Delhi, Delhi-110 007, India.. surjeetsuneja@gmail.com
Pooja Louhan
Affiliation:
Department of Mathematics, University of Delhi, Delhi-110 007, India.; poojalouhan@gmail.com.
Get access

Abstract

In this paper we give necessary and sufficient optimality conditions for a vector optimization problem over cones involving support functions in objective as well as constraints, using cone-convex and other related functions. We also associate a unified dual to the primal problem and establish weak, strong and converse duality results. A number of previously studied problems appear as special cases.

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI, 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Craven, B.D., Nonsmooth multiobjective programming. Numer. Func. Anal. Optim. 10 (1989) 4964. Google Scholar
Mond, B. and Schechter, M., A duality theorem for a homogeneous fractional programming problem. J. Optim. Theory. Appl. 25 (1978) 349359. Google Scholar
D.T. Luc, Theory of vector optimization. Springer (1989).
Flores–Bazán, F. and Vera, C., Unifying efficiency and weak efficiency in generalized quasiconvex vector minimization on the real-line. Int. J. Optim. Theory: Theory, Methods and Appl. 1 (2009) 247265. Google Scholar
Flores–Bazán, F., Hadjisavvas, N. and Vera, C., An optimal altenative theorem and applications to mathematical programming. J. Glob. Optim. 37 (2007) 229243. Google Scholar
F.H. Clarke, Optimization and nonsmooth analysis. A Wiley-Interscience Publication (1983).
Zalmai, G.J., Generalized (η,ρ)-invex functions and global semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms. J. Glob. Optim. 36 (2006) 5185. Google Scholar
Husain, I., Ahmed, A. and Mattoo, R.G., On multiobjective nonlinear programming with support functions. J. Appl. Anal. 16 (2010) 171187. Google Scholar
Husain, I., Abha, and Jabeen, Z., On nonlinear programming with support functions. J. Appl. Math. Comput. 10 (2002) 8399. Google Scholar
J. Jahn, Vector optimization: Theory, applications and extensions. Springer (2011).
Schechter, M., A subgradient duality theorem. J. Math. Anal. Appl. 61 (1977) 850855. Google Scholar
Schechter, M., More on subgradient duality. J. Math. Anal. Appl. 71 (1979) 251262. Google Scholar
Cambini, R., Some new classes of generalized concave vector-valued functions. Optim. 36 (1996) 1124. Google Scholar
R. Cambini and L. Carosi, Mixed type duality for multiobjective optimization problems with set constraints, in Optimality conditions in vector optimization, edited by Manuel Arana Jiménez, G. Ruiz-Garzón and A. Rufián-Lizan., Bentham Sci. Publishers, The Netherlands (2010) 119–142.
Suneja, S.K., Louhan, P. and Grover, M.B., Higher-order cone-pseudoconvex, quasiconvex and other related functions in vector optimization. Optim. Lett. 7 (2013) 647664. Google Scholar
Suneja, S.K., Sharma, S. and Vani, , Second-order duality in vector optimization over cones. J. Appl. Math. Inform. 26 (2008) 251261. Google Scholar
Illés, T. and Kassay, G., Theorems of the alternative and optimality conditions for convexlike and general convexlike programming. J. Optim. Theory. Appl. 101 (1999) 243257. Google Scholar
Weir, T., Mond, B. and Craven, B.D., Weak minimization and duality. Numer. Funct. Anal. Optim. 9 (1987) 181192. Google Scholar