A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
From MaRDI portal
Publication:949520
DOI10.1016/j.mcm.2007.09.002zbMath1145.90451OpenAlexW2079997663MaRDI QIDQ949520
Publication date: 21 October 2008
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2007.09.002
Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items (1)
Cites Work
- On optimality and duality theorems of nonlinear disjunctive fractional minmax programs
- Duality in disjunctive linear fractional programming
- Symmetric duality for disjunctive programming with absolute value functionals
- Optimization with disjunctive constraints
- Duality in generalized nonlinear fractional programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Duality in disjunctive programming via vector optimization
- Parametric disjunctive programming: One-sided differentiability of the value function
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Higher-order symmetric duality in nondifferentiable multiobjective programming problems.
- An approximate approach for fractional programming with absolute-value functions
- Optimality conditions and duality for a minimax fractional programming with generalized convexity
- Convex programming for disjunctive convex optimization
- Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- A note on the paper ``Fractional programming with convex quadratic forms and functions by \textit{H. P. Benson} [Eur. J. Oper. Res. 173, No. 2, 351--369 (2006; Zbl 1113.90122)]
- Fractional programming with convex quadratic forms and functions
- On the optimality of nonlinear fractional disjunctive programming problems
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- One-sided derivatives for the value function in convex parametric programming
- Fractional Programming. I, Duality
- Disjunctive Programming
- Method of centers for generalized fractional programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
