On minimax fractional programming of generalized convex set functions
From MaRDI portal
Recommendations
- Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions
- A note on fractional minmax programs containing \(n\)-set functions
- Duality for a minimax programming problem containing n-set functions
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Optimization theory for set functions in nondifferentiable fractional programming with mixed type duality
Cites work
- scientific article; zbMATH DE number 682561 (Why is no real title available?)
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- Duality for a minimax programming problem containing \(n\)-set functions
- Duality for generalized fractional programs involving n-set functions
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- Duality without a constraint qualification for minimax fractional programming
- Existence and Lagrangian duality for maximization of set-valued functions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Minimax fractional programming involving generalised invex functions
- Moreau-Rockafellar type theorem for convex set functions
- Necessary and sufficient conditions for minimax fractional programming
- Oil minmax programming problems containing n-set functions
- On duality of multiobjective fractional measurable subset selection problems
- On the optimality conditions of vector-valued \(n\)-set functions
- Optimal constrained selection of a measurable subset
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Optimality conditions and duality for multiobjective measurable subset selection problems
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- Optimization theory for n-set functions
- Programming problems involving generalized convex set functions
- Saddle point and duality in the optimization theory of convex set functions
- Second order optimality conditions for mathematical prograramming with set functions
- The Fenchel-Moreau Theorem for Set Functions
Cited in
(14)- A sixth bibliography of fractional programming
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions
- Three types dual model for minimax fractional programming
- Programming problems involving generalized convex set functions
- Parameter-free dual models for fractional programming with generalized invexity
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
- Minimax fractional programming involving generalised invex functions
- Complex fractional programming and the Charnes-Cooper transformation
- Optimization theory for set functions in nondifferentiable fractional programming with mixed type duality
- A taxonomy and review of the multi-objective fractional programming (MOFP) problems
- On duality theorems for a nondifferentiable minimax fractional programming
- Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity
- On a dynamic fractional game
This page was built for publication: On minimax fractional programming of generalized convex set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978809)
