Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions
From MaRDI portal
Publication:4465493
DOI10.1080/09720502.2003.10700330zbMath1140.90507OpenAlexW1974609801MaRDI QIDQ4465493
No author found.
Publication date: 9 June 2004
Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720502.2003.10700330
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- 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
- On efficiency and duality for multiobjective programs
- B-vex functions
- Generalized B-vex functions and generalized B-vex programming
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- Wolfe-type duality involving \((B,\eta)\)-index functions for a minimax programming problem
- Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions
- Vector-valued lagrangian and multiobjective fractional programming duality
- A duality theorem for non-linear programming
- Further Generalizations of Convexity in Mathematical Programming
- On generalised convex mathematical programming
- Further Properties of b-Vex Functions
- Generalized fractional programming duablity: a ratio game approach
