On duality in generalized minimax programs

On duality in generalized minimax programs

0.00 Avg rating0 Votes
Article ID: iaor19941901
Country: Singapore
Volume: 7
Issue: 1
Start Page Number: 55
End Page Number: 62
Publication Date: May 1990
Journal: Asia-Pacific Journal of Operational Research
Authors: , ,
Keywords: programming: mathematical
Abstract:

Duality results are obtained for a minimax problem under pseudoconvex hypothesis, generalizing recent results of Bector and Chandra. These results are then applied to a minimax problem with fractional objectives.

Reviews

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