Journal of applied mathematics & informatics

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

ON NONLINEAR PROGRAMMING WITH SUPPORT FUNCTIONS

  • Husain, I. (Department of Mathematics, Regional Engineering College) ;
  • Abha (Department of Mathematics, Indian Institute of Technology) ;
  • Jabeen, Z. (Department of Mathematics, Regional Engineering College)
  • Published : 2002.09.01

⟨ Previous Next ⟩

Abstract

Optimality conditions are derived for a nonlinear program in which a support function appears in the objective as well as in each constraint function. Wolfe and Mond-Weir type duals to this program are presented and various duality results are established under suitable convexity and generalized convexity assumptions. Special cases that often occur in the literature are those in which a support function is the square root of a positive semi- definite quadratic form or an Lp norm. It is pointed out that these special cases can easily be generated from our results.

Keywords

References

  1. Optimization v.16 Generalized concavity and duality with square root term S.Chandra;B.D. Craven;B.Mond
  2. Math. Operations Res. v.1 A new approach to Langrangian multipliers F.H.Clarke
  3. Optimization and Nonsmooth Analysis F.H.Clarke
  4. Nonlinear Programming O.L.Mangasarain
  5. J.Math. Anal. Appl. v.46 A class of nondifferential mathematical programming problems B.Mond
  6. J.Austral. Math. soc. Ser. B. v.19 A programming problem with an Lp norm in the objective function B. Mond;M.Schechter
  7. JOTA v.25 A duality theorem for a homogeneous fractional programming problem B. Mond;M.Schechter
  8. J.Math. Anal. Appl. v.61 A subgradient duality theorem M.Schechter
  9. J. Math. Anal. Appl. v.71 More on subgradient duality M.Schechter