Duality for minmax \(B\)-vex programming involving \(n\)-set functions
From MaRDI portal
Publication:1378590
DOI10.1006/jmaa.1997.5624zbMath0894.90162OpenAlexW1994923236MaRDI QIDQ1378590
Publication date: 9 February 1998
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1997.5624
minimax programming\(B\)-vex \(n\)-set functionsnecessary and sufficient optimality theoremsWolfe type duality results
Fractional programming (90C32) Programming in abstract spaces (90C48) Convexity of real functions of several variables, generalizations (26B25)
Related Items (5)
Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions ⋮ A sixth bibliography of fractional programming
Cites Work
- Optimization theory for n-set functions
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- Optimal constrained selection of a measurable subset
- An algorithm for generalized fractional programs
- Saddle-point type optimality criteria for generalized fractional programming
- Generalized fractional programming duality: A parametric approach
- On sufficiency of the Kuhn-Tucker conditions
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized nonlinear fractional programming
- B-vex functions
- Generalized B-vex functions and generalized B-vex programming
- Efficiency and duality for nonlinear multiobjective programs involving \(n\)-set functions
- Duality for multiobjective fractional programming involving \(n\)-set functions
- Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions
- Vector-valued lagrangian and multiobjective fractional programming duality
- Duality in generalized linear fractional programming
- A duality theorem for non-linear programming
- On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
- On generalised convex mathematical programming
- Further Properties of b-Vex Functions
- Generalized fractional programming duablity: a ratio game approach
- Best Rational Approximation and Strict Quasi-Convexity
- Duality in nonlinear fractional programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Duality for minmax \(B\)-vex programming involving \(n\)-set functions
