Title of article
On Minimax Fractional Programming of Generalized Convex Set Functions1
Author/Authors
H. C. Lai، نويسنده , , J. C. Liu، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2000
Pages
24
From page
442
To page
465
Abstract
We derive necessary and sufficient optimality conditions for the discrete mini-
max programming problem with subdifferentiable I, r, u.-convex set functions.
Then we apply these optimality criteria to construct two models of parameter-free
dual problems and a third model of another dual problem. We also establish weak,
strong, and strictly converse duality theorems
Keywords
convex set function , convex family ofmeasurable , subdifferentiable set function
Journal title
Journal of Mathematical Analysis and Applications
Serial Year
2000
Journal title
Journal of Mathematical Analysis and Applications
Record number
933109
Link To Document