On the optimality of nonlinear fractional disjunctive programming problems

Authors:
E. E. Ammar
Affiliations:
Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 3
Cited 1

Duality in disjunctive programming via vector optimization

Mathematical Programming: Series A and B
Disjunctive programming: properties of the convex hull of feasible points

Discrete Applied Mathematics
Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation

Computational Optimization and Applications

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

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

This paper is concerned with the study of necessary and sufficient optimality conditions for convex-concave 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.