A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming

Autor:	E. E. Ammar
Rok vydání:	2008
Předmět:	Algebra Fractional programming Modeling and Simulation Modelling and Simulation Convex optimization Convex set Duality (optimization) Stationary point Saddle Convexity Mathematics Nonlinear programming Computer Science Applications
Zdroj:	Mathematical and Computer Modelling. 48(1-2):69-82
ISSN:	0895-7177
DOI:	10.1016/j.mcm.2007.09.002
Popis:	This paper is concerned with the study of necessary and sufficient optimality conditions for convex-concave generalized fractional disjunctive programming problems for which the decision set is the union of a family of convex sets. The Lagrangian function for such problems is defined and the Kuhn-Tucker Saddle and Stationary points are characterized. In addition, some important theorems related to the Kuhn-Tucker problem for saddle and stationary points are established. Moreover, a general dual problem is formulated and weak, strong and converse duality theorems are proved. Throughout the presented paper illustrative examples are given to clarify and implement the developed theory.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00afd3f4d34896abea88d52df7c893a5 Zobrazit plný text záznamu Full Text from ScienceDirect