Abstract
Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of complex nondifferentiable fractional programming problems containing generalized convex functions. Subsequently, these optimality criteria are utilized as a basis for constructing one parametric and two other parameter-free dual models with appropriate duality theorems.
Original language | English |
---|---|
Pages (from-to) | 804-824 |
Number of pages | 21 |
Journal | Journal of Mathematical Analysis and Applications |
Volume | 210 |
Issue number | 2 |
DOIs | |
State | Published - 15 Jun 1997 |