Mixed type duality for a programming problem containing support function
- 41 Downloads
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.
AMS Mathematics Subject ClassificationPrimary 90C30 Secondary 90C11 90C20 90C26
Key words and phrasesProgramming problem support function mixed type duality generalized convexity generalized invexity
- 3.I. V. Girasanov,Lectures on mathematical theory of extremum problem, Springer-Verlag, New York, 1972.Google Scholar
- 5.O. L. Mangasarian,Non-linear programming, McGraw-Hill, New York, (1969).Google Scholar
- 7.Mond and T. Weir,Generalized concavity and duality in generalized concavity in optimization and economics, (S. Schaible and W.T. Ziemba, Editors) Academic Press, New York, 1981.Google Scholar