Journal of applied mathematics & informatics

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

MIXED TYPE DUALITY FOR A PROGRAMMING PROBLEM CONTAINING SUPPORT FUNCTION

  • Husain, I. (Department of Mathematics, National Institute of technology) ;
  • Jabeen, Z. (Department of Mathematics, National Institute of technology)
  • Published : 2004.05.01

⟨ Previous Next ⟩

Abstract

A mixed type dual to a programming problem containing support functions in a objective as well as constraint functions is formulated and various duality results are validated under generalized convexity and invexity conditions. Several known results are deducted as special cases.

Keywords

References

  1. J. Math. Anal. Appl. v.259 On mixed duality in mathematical programming C. R. Bector;S. Chandra;Abha
  2. Math. Operations Res. v.1 A new approach to Langragian multipliers F. H. Clarke
  3. Lectures on mathematical theory of extremum problem I. V. Girasanov
  4. L. Appl. Math and computing v.10 no.1-2 On nonlinear programming with suport functions I. Husain;Abha;Jabeen
  5. Non-linear programming O. L. Mangasarian
  6. J. Optimization Theory Appl. v.25 A duality theorem for a homogenous fractional programming problem B. Mond;M. Scheter
  7. Generalized concavity and duality in generalized concavity in optimization and economics Mond;T. Weir;S. Schaible(ed.);W.T Ziemba(ed.)
  8. J. Math. Anal. and Appl. v.71 More on sub-gradient duality M. Schecter
  9. Quart. Appl. Math. v.19 A duality theorem for nonlinear programming problem P. Wolfe
  10. J. Math. Anal. Appl. v.198 Mixed type duality in multiobjective programming Z. Xu
  11. Bull. Austral. Math. Soc. v.55 Duality for a class of non-differentiable continous programming problems J. Zhang;B. Mond