On optimality and duality theorems of nonlinear disjunctive fractional minmax programs

DOI10.1016/j.ejor.2006.08.051zbMath1122.90090OpenAlexW2017949423MaRDI QIDQ872111

N. E. Zubov

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.051

zbMATH Keywords

dualityfractional programmingsaddle pointLagrangian functionKuhn-Tucker pointdisjunctive optimization problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality in disjunctive linear fractional programming
• Symmetric duality for disjunctive programming with absolute value functionals
• Optimization with disjunctive constraints
• 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
• Multiparametric sensitivity analysis in programming problem with linear-plus-linear fractional objective function
• Convex programming for disjunctive convex optimization
• 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

This page was built for publication: On optimality and duality theorems of nonlinear disjunctive fractional minmax programs