Generalized pseudo convex minmax programming

Generalized pseudo convex minmax programming

0.00 Avg rating0 Votes
Article ID: iaor1999397
Country: India
Volume: 35
Issue: 1
Start Page Number: 32
End Page Number: 44
Publication Date: Mar 1998
Journal: OPSEARCH
Authors:
Keywords: minimax problem
Abstract:

Necessary and sufficient optimality conditions are obtained for a general minmax problem under generalized pseudo convexity assumptions. A dual problem is also defined and weak and strong duality established under the aforesaid assumptions.

Reviews

Required fields are marked *. Your email address will not be published.