Sufficient optimality conditions and duality for a continuous-time minimax programming problem

Sufficient optimality conditions and duality for a continuous-time minimax programming problem

0.00 Avg rating0 Votes
Article ID: iaor19932005
Country: Singapore
Volume: 9
Issue: 1
Start Page Number: 55
End Page Number: 76
Publication Date: May 1992
Journal: Asia-Pacific Journal of Operational Research
Authors: , ,
Keywords: lagrange multipliers, programming: mathematical
Abstract:

Various theorems giving sufficient optimality conditions for a continuous-time minimax programming problem are established. As an application of these optimality conditions, a dual for this problem is presented and appropriate duality investigated. A converse duality theorem is also proved for a special case.

Reviews

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