A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
نویسندگان
چکیده
منابع مشابه
A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
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...
متن کاملOn the optimality of nonlinear fractional disjunctive programming problems
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...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملNew Algorithms for Nonlinear Generalized Disjunctive Programming
Generalized Disjunctive Programming (GDP) has been introduced recently as an alternative model to MINLP for representing discrete/continuous optimization problems. The basic idea of GDP consists of representing discrete decisions in the continuous space with disjunctions, and constraints in the discrete space with logic propositions. In this paper, we describe a new convex nonlinear relaxation ...
متن کاملOptimality and Duality for Minimax Fractional Semi-Infinite Programming
The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2008
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2007.09.002