Optimality and Duality for Complex Nondifferentiable Fractional Programming

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 para...

Full description

Saved in:
Bibliographic Details
Published inJournal of mathematical analysis and applications Vol. 210; no. 2; pp. 804 - 824
Main Authors Liu, Jen-Chwan, Lin, Chin-Cheng, Sheu, Ruey-Lin
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.06.1997
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0022-247X
1096-0813
DOI:10.1006/jmaa.1997.5448