Publicación: CHARACTERIZATION OF WEAKLY EFFICIENT SOLUTIONS FOR NONLINEAR MULTIOBJETIVE PROGRAMMING PROBLEMS. DUALITY
Fecha
2014
Autores
Título de la revista
ISSN de la revista
Título del volumen
Editor
JOURNAL OF CONVEX ANALYSIS
Resumen
CONVEXITY AND GENERALIZED CONVEXITY PLAY A CENTRAL ROLE IN MATHEMATICAL PROGRAMMING FOR DUALITY RESULTS AND IN ORDER TO CHARACTERIZE THE SOLUTIONS SET. IN THIS PAPER, TAKING IN MIND CRAVEN'S NOTION OF K-INVEXITY FUNCTION (WHEN K IS A CONE IN R-N) AND MARTIN'S NOTION OF KARUSH-KUHN-TUCKER INVEXITY (HEREAFTER KKT-INVEXITY), WE DEFINE NEW NOTIONS OF GENERALIZED CONVEXITY FOR A MULTIOBJECTIVE PROBLEM WITH CONIC CONSTRAINTS. THESE NEW NOTIONS ARE BOTH NECESSARY AND SUFFICIENT TO ENSURE EVERY KARUSH-KUHN-TUCKER POINT IS A SOLUTION. THE STUDY OF THE SOLUTIONS IS ALSO DONE THROUGH THE SOLUTIONS OF AN ASSOCIATED SCALAR PROBLEM. A MOND-WEIR TYPE DUAL PROBLEM IS FORMULATED AND WEAK AND STRONG DUALITY RESULTS ARE PROVIDED. THE NOTIONS AND RESULTS THAT EXIST IN THE LITERATURE UP TO NOW ARE PARTICULAR INSTANCES OF THE ONES PRESENTED HERE.
