On minimax fractional programming of generalized convex set functions
DOI10.1006/JMAA.2000.6715zbMATH Open1073.90543OpenAlexW2068703407MaRDI QIDQ1978809FDOQ1978809
Publication date: 14 December 2000
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.2000.6715
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
duality theoremsconvex set functionconvex family of measurable sets(\(\mathcal I, \rho, \theta\))-convex functions(\(\mathcal I, \rho, \theta\))-pseudoconvex functions(\(\mathcal I, \rho, \theta\))-quasiconvex functionssubdifferentiable set function
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Cites Work
- Existence and Lagrangian duality for maximization of set-valued functions
- Necessary and sufficient conditions for minimax fractional programming
- On the optimality conditions of vector-valued \(n\)-set functions
- Optimization theory for n-set functions
- Duality without a constraint qualification for minimax fractional programming
- Minimax fractional programming involving generalised invex functions
- On duality of multiobjective fractional measurable subset selection problems
- Duality for generalized fractional programs involving n-set functions
- Oil minmax programming problems containing n-set functions
- Optimal constrained selection of a measurable subset
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Duality for a minimax programming problem containing \(n\)-set functions
- Moreau-Rockafellar type theorem for convex set functions
- Second order optimality conditions for mathematical prograramming with set functions
- The Fenchel-Moreau Theorem for Set Functions
- Saddle point and duality in the optimization theory of convex set functions
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- Programming problems involving generalized convex set functions
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Title not available (Why is that?)
- Optimality conditions and duality for multiobjective measurable subset selection problems
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
Cited In (13)
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
- Complex fractional programming and the Charnes-Cooper transformation
- Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity
- Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions
- Programming problems involving generalized convex set functions
- On a dynamic fractional game
- Three types dual model for minimax fractional programming
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- A taxonomy and review of the multi-objective fractional programming (MOFP) problems
- A sixth bibliography of fractional programming
- On duality theorems for a nondifferentiable minimax fractional programming
- Parameter-free dual models for fractional programming with generalized invexity
- Minimax fractional programming involving generalised invex functions
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)
