Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program

References

• Hoai An , LT , Tao , PD and Muu , LD . 1996 . Numerical solution for optimization over the efficient set by DC optimization algorithms . Oper. Res. Lett. , 19 : 117 – 126 .
   Web of Science ®Google Scholar
• Hoai An , LT , Tao , PD and Muu , LD . 2003 . Simplicially constrained DC optimization over the efficient and weakly efficient sets . J. Optim. Theory Appl. , 117 : 503 – 521 .
   Google Scholar
• Auslender , A . 1976 . Optimization: Methods Numeriques , Paris : Masson .
   Google Scholar
• Benson , H . 1998 . An outer approximation algorithm for generating all efficient extreme point in the outcome set of a multiple objective linear programming problem . J. Global Optim. , 13 : 1 – 24 .
   Web of Science ®Google Scholar
• Benson , H . 1984 . Optimization over the efficient set . J. Math. Anal. Appl. , 98 : 562 – 580 .
   Web of Science ®Google Scholar
• Benson , H . 1991 . An all-linear programming relaxation algorithm for optimizing over the efficient set . J. global Optim. , 1 : 83 – 104 .
   Google Scholar
• Benson , H . 1992 . A finite, nonadjacent extreme point search algorithm for optimization over the efficient set . J. Optim. Theory Appl. , 73 : 47 – 64 .
   Web of Science ®Google Scholar
• Ben-Tal , A . 1994 . Global minimization by reducing the duality gap . Math. Program. , 63 : 193 – 212 .
   Google Scholar
• Berge , C . 1968 . Topological Spaces , New York : MacMillan .
   Google Scholar
• Bertsekas , PD . 2003 . Nonlinear Programming , Nashua, , USA : Second Printing, Athena Scientific .
   Google Scholar
• Choo , EU and Atkins , DR . 1983 . Connectedness in multiple linear fractional programming . Management Sci. , 29 : 250 – 255 .
   Web of Science ®Google Scholar
• Choo , EU and Atkins , DR . 1982 . Bicriteria linear fractional programming . J. Optim. Theory Appl. , 38 : 203 – 220 .
   Google Scholar
• Ecker , J and Song , J . 1994 . Optimizing a linear function over the efficient set . J. Optim. Theory Appl. , 83 : 541 – 563 .
   Web of Science ®Google Scholar
• Falk , JE . 1969 . Lagrange multipliers and nonconvex programs . SIAM J. Control , 7 : 534 – 545 .
   Google Scholar
• Fukushima , M . 1996 . A new merit function and a successive quadratic programming algorithm for variational inequality problems . SIAM J. Optim. , 6 : 703 – 713 .
   Google Scholar
• Horst , R and Tuy , H . 1996 . Global Optimization (Deterministic Approaches) , 3 , Berlin : Springer .
   Google Scholar
• Jorge , JM . 2005 . A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem . J. Global Optim. , 31 : 1 – 16 .
   Google Scholar
• Kim , NTB and Luc , DT . 2000 . Normal cones to polyhedral convex set and generating efficient faces in linear multiobjective programming . Acta Math. Vietnam. , 25 : 100 – 124 .
   Google Scholar
• Luc , LT and Muu , LD . 1997 . “ A Global optimization approach to optimization over the efficient set ” . In Recent Advances in Optimization , Edited by: Gritzmann , P , Horst , R , Sachs , E and Tichtschke , R . 183 – 195 . Berlin : Springer Verlag .
   Google Scholar
• Luc , DT , Phong , TQ and Volle , M . 2005 . Scalarizing functions for generating the weakly efficient solution set in convex multiobjective problems . SIAM J. Optim. , 15 : 987 – 2001 .
   Web of Science ®Google Scholar
• Malivert , C . Multicriteria fractional optimization, Proceeding of the 12th Catalans Days on Applied Mathematics (1995) pp. 189–198
   Google Scholar
• Muu , LD and Oettli , W . 2000 . Optimization over equilibrium sets . Optimization , 49 : 179 – 189 .
   Google Scholar
• Philip , J . 1972 . Algorithms for the vector maximization problem . Math. Program. , 1 : 207 – 228 .
   Google Scholar
• Schaible , S . 1981 . Fractional programming: Applications and algorithms . Eur. Oper. Res. , 75 : 111 – 120 .
   Google Scholar
• Shor , NZ and Stetsyk , PI . 2002 . Lagrangian bounds in multiextremal polynomial and discrete optimization problems . J. Global Optim. , 23 : 1 – 41 .
   Google Scholar
• Steuer , RE . 1996 . Multiple Criteria Optimization: Theory, Computation and Application , New York : John Wiley and Sons .
   Google Scholar
• Thoai , NN . 2002 . Convergence and application of a decomposition method using duality bounds for nonconvex global optimization . J. Optim. Theory Appl. , 113 : 165 – 193 .
   Google Scholar
• Tuy , H . 2005 . On solving nonconvex optimization problems by reducing the duality gap . J. of Global Optimization , 32 : 349 – 365 .
   Google Scholar
• Tuy , H . 1991 . Effect of subdivision strategy on convergence and efficiency of some global optimization algorithms . J. Global Optim. , 1 : 23 – 36 .
   Google Scholar
• Tuyen , HQ and Muu , LD . 2001 . Biconvex programming approach to optimization over the efficient set of a multiple objective affine fractional problem . Oper. Res. Lett. , 28 : 81 – 92 .
   Google Scholar
• Zeleny , M . 1974 . Linear Multiobjective Programming , Berlin : Springer-Verlag .
   Google Scholar