Duality without a constraint qualification for minimax fractional programming

Duality without a constraint qualification for minimax fractional programming

0.00 Avg rating0 Votes
Article ID: iaor2000465
Country: United States
Volume: 101
Issue: 1
Start Page Number: 109
End Page Number: 125
Publication Date: Apr 1999
Journal: Journal of Optimization Theory and Applications
Authors: , ,
Keywords: duality
Abstract:

Using a parametric approach, we establish the necessary and sufficient conditions for generalized fractional programming without the need of a constraint qualification. Subsequently, these optimality criteria are utilized as a basis for constructing a parametric dual model and two other parameter-free dual models. Several duality theorems are established.

Reviews

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