Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

SADDLE POINT AND GENERALIZED CONVEX DUALITY FOR MULTIOBJECTIVE PROGRAMMING

  • Published : 2004.05.01

⟨ Previous Next ⟩

Abstract

In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

Keywords

References

  1. J. Inform, Optim. v.3 Further generalizations of convexity in mathematical programing M.A. Hanson;B.Mond
  2. Multiobjective decision making theory and methodology V.Chankong;Y.Y.Haimes
  3. J. Math. Anal. Appl. v.138 Efficiency and generalized convex duality for multiobjective programs Richard.R.Egudo
  4. Proceedings, Berkeley Symposium on Mathematical Statistics and Probability Nonlinear programing H.W.Kuhn;A.W.Tucker
  5. Nonlinear Programing O. L. Mangasarian
  6. Quart. Appl. Math. v.19 A duality theorem for nonlinear programming P. Wolfe
  7. Generalized concavity and duality B.Mond;T.Weir