Optimality via generalized approximate convexity and quasiefficiency

1. Bector C.R., Chandra S., Dutta J.: Principles of Optimization Theory. Narosa Publishing House, India (2005)

   Google Scholar 

2. Bhatia D., Jain P.: Generalized (F, ρ) convexity and duality for nonsmooth multiobjective programs. Optimization. 31, 153–164 (1994)

   Article  MATH  Google Scholar 

3. Chinchuluun A., Pardalos P.M.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 154(1), 29–50 (2007)

   Article  MathSciNet  MATH  Google Scholar 

4. Chinchuluun, A., Pardalos, P.M., Migdalas, A., Pitsoulis, L. (eds): Pareto Optimality, Game Theory and Equilibria. Springer, Berlin (2008)

   MATH  Google Scholar 

5. Clarke F.H.: Optimization and Nonsmooth Analysis. Willey-Inteerscience, New York (1983)

   MATH  Google Scholar 

6. Dutta J., Vetrivel V.: On approximate minima in vector optimization. Numer. Funct. Anal. Optim. 22, 845–859 (2001)

   Article  MathSciNet  MATH  Google Scholar 

7. Egudo R.: Efficiency and generalized convex duality for multi-objective programs. J. Math. Anal. Appl. 138, 84–94 (1989)

   Article  MathSciNet  MATH  Google Scholar 

8. Govil M.G., Mehra A.: \({\varepsilon}\)-optimality for multiobjective programming on a Banach space. Eur. J. Oper. Res. 157, 106–112 (2004)

   Article  MathSciNet  MATH  Google Scholar 

9. Gupta A., Mehra A., Bhatia D.: Approximate convexity in vector optimization. Bull. Aust. Math. Soc. 74, 207–218 (2006)

   Article  MathSciNet  MATH  Google Scholar 

10. Hanson M.A., Mond B.: Necessary and sufficient conditions in constrained optimization. Math. Program. 37, 51–58 (1987)

    Article  MathSciNet  MATH  Google Scholar 

11. Jeykumar V., Mond B.: On generalized convex mathematical programming. J. Aust. Math. Soc. Ser. B. 34, 43–53 (1992)

    Article  Google Scholar 

12. Liang Z.-A., Huang H.X., Pardalos P.M.: Efficiency conditions and duality for a class of multiobjective fractional programming problem. J. Glob. Optim. 27(4), 447–471 (2003)

    Article  MathSciNet  MATH  Google Scholar 

13. Liu J.C.: \({\varepsilon}\)-duality theorem of nondifferentiable nonconvex multiobjective programming. J. Optim. Theory Appl. 69, 153–167 (1991)

    Article  MathSciNet  MATH  Google Scholar 

14. Loridan P.: \({\varepsilon}\)-solutions in vector minimization problems. J. Optim. Theory Appl. 43, 265–276 (1984)

    Article  MathSciNet  MATH  Google Scholar 

15. Ngai H.V., Luc D., Thera M.: Approximate convex functions. J. Nonlinear Convex Anal. 1, 155–176 (2000)

    MathSciNet  MATH  Google Scholar 

16. Pardalos P.M., Yuan D., Liu X., Chinchuluun A.: Optimality conditions and duality for multiobjective programming involving (c, α, ρ, d)type-I functions. In: Konnov, I.V., Luc, D.T., Rubinov, A.M. (eds) Generalized Convexity and Related Topics, pp. 73–87. Springer, Berlin (2007)

    Google Scholar 

Download references