A solvability theorem and minimax fractional programming

A solvability theorem and minimax fractional programming

0.00 Avg rating0 Votes
Article ID: iaor19932400
Country: Germany
Volume: 37
Issue: 1
Start Page Number: 1
End Page Number: 12
Publication Date: Jan 1993
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

This paper presents a stable solvability theorem for general inequality systems under a local closedness condition. It is shown how this mild regularity condition can be characterized by the validity of the solvability theorem for all local perturbations. Based on this solvability thoerem zero duality gap and stability are established for general minimax fractional programming problems.

Reviews

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