Citation
Hc. Lai et Jc. Liu, On minimax fractional programming of generalized convex set functions, J MATH ANAL, 244(2), 2000, pp. 442-465
Citations number
23
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
ISSN journal
0022247X
→ ACNP
Volume
244
Issue
2
Year of publication
2000
Pages
442 - 465
Database
ISI
SICI code
0022-247X(20000415)244:2<442:OMFPOG>2.0.ZU;2-1
Abstract
We derive necessary and sufficient optimality conditions for the discrete m
inimax programming problem with subdifferentiable (T, rho, theta)-convex se
t functions. Then we apply these optimally criteria to construct two model
of parameter-free dual problems and a third model of another dual problem.
We also establish weak, strong, and strictly converse duality theorems. (C)
2000 Academic Press.