Duality for a minimax programming problem containing \(n\)-set functions
From MaRDI portal
Publication:1279952
DOI10.1006/jmaa.1998.6187zbMath0922.90121OpenAlexW2003781367MaRDI QIDQ1279952
Publication date: 17 February 1999
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1998.6187
necessary and sufficient optimality conditionsduality theoremsminimax fractional problemdifferentiable \(n\)-set functionsdiscrete minimax programming problem
Multi-objective and goal programming (90C29) Fractional programming (90C32) Existence of solutions for minimax problems (49J35)
Related Items (10)
Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Minimax fractional programming involving generalised invex functions ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ Three types dual model for minimax fractional programming ⋮ On minimax fractional programming of generalized convex set functions ⋮ On duality theorems for a nondifferentiable minimax fractional programming ⋮ Parameter-free dual models for fractional programming with generalized invexity ⋮ 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
- Unnamed Item
- Optimization theory for n-set functions
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- Optimal constrained selection of a measurable subset
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- Duality theorem of nondifferentiable convex multiobjective programming
- Existence and Lagrangian duality for maximization of set-valued functions
- Strong duality for infinite-dimensional vector-valued programming problems
- Moreau-Rockafellar type theorem for convex set functions
- Optimality for set functions with values in ordered vector spaces
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- On the optimality conditions of vector-valued \(n\)-set functions
- On the optimality of differentiable nonconvex \(n\)-set functions
- Necessary and sufficient conditions for minimax fractional programming
- Duality without a constraint qualification for minimax fractional programming
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- Efficiency and duality for nonlinear multiobjective programs involving \(n\)-set functions
- Optimization of set-valued functions
- Duality for multiobjective fractional programming involving \(n\)-set functions
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- On duality of multiobjective fractional measurable subset selection problems
- Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
- Duality for generalized fractional programs involving n-set functions
- Optimality conditions and duality for multiobjective measurable subset selection problems
- The Fenchel-Moreau Theorem for Set Functions
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Saddle point and duality in the optimization theory of convex set functions
- Oil minmax programming problems containing n-set functions
- Multiobjective Fractional Duality Forn-Set Functions
- Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef:
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- Optimality and duality for multiobjective programming involving subdifferentiable set functions
This page was built for publication: Duality for a minimax programming problem containing \(n\)-set functions
