Journal of Optimization Theory and Applications

, Volume 50, Issue 3, pp 407–420

Duality theorem of nondifferentiable convex multiobjective programming

  • H. C. Lai
  • C. P. Ho
Contributed Papers

DOI: 10.1007/BF00938628

Cite this article as:
Lai, H.C. & Ho, C.P. J Optim Theory Appl (1986) 50: 407. doi:10.1007/BF00938628

Abstract

Necessary and sufficient conditions of Fritz John type for Pareto optimality of multiobjective programming problems are derived. This article suggests to establish a Wolfe-type duality theorem for nonlinear, nondifferentiable, convex multiobjective minimization problems. The vector Lagrangian and the generalized saddle point for Pareto optimality are studied. Some previously known results are shown to be special cases of the results described in this paper.

Key Words

Multiobjective programmingPareto optimalitydual problems of multiobjective programmingweak Pareto optimalitygeneralized saddle points

Copyright information

© Plenum Publishing Corporation 1986

Authors and Affiliations

  • H. C. Lai
    • 1
  • C. P. Ho
    • 2
  1. 1.Institute of MathematicsNational Tsing Hua UniversityHsinchuTaiwan, ROC
  2. 2.Department of MathematicsTunghai UniversityTaichungTaiwan, ROC