Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
From MaRDI portal
Publication:819625
DOI10.1016/j.jmaa.2005.04.031zbMath1156.90019OpenAlexW1984812465MaRDI QIDQ819625
Publication date: 29 March 2006
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.04.031
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items (5)
The Schur multiplicative and harmonic convexities of the complete symmetric function ⋮ Mixed Lagrange function in minimax fractional programming problems ⋮ Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs ⋮ On stability of proper efficient solutions in multiobjective fractional programming problems under fuzziness ⋮ Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Generalized convex set functions
- On the optimality conditions of vector-valued \(n\)-set functions
- On the optimality of differentiable nonconvex \(n\)-set functions
- Duality in generalized nonlinear fractional programming
- Goal programming and multiple objective optimizations. Part I
- Duality for a minimax programming problem containing \(n\)-set functions
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions
- A note on fractional minmax programs containing \(n\)-set functions
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions
- On duality of multiobjective fractional measurable subset selection problems
- On minimax fractional programming of generalized convex set functions
- Duality for generalized fractional programs involving n-set functions
- Duality relations for generalized fractional programming involving \(n\)-set functions
- Generalized \((\mathcal F, b,\phi,\rho,\theta)\)-univex \(n\)-set functions and semiparametric duality models in multiobjective fractional subset programming
- Generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univex \(n\)-set functions and global semiparametric sufficient efficiency conditions in multiobjective fractional subset programming
- Generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univex \(n\)-set functions and global parametric sufficient optimality conditions in minmax fractional subset programming
- Generalized \((\mathcal{F},b,\phi,\rho,\theta)\)-univex \(n\)-set functions and parametric duality models in minmax fractional subset programming
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Oil minmax programming problems containing n-set functions
- Multicriteria Programming for Financial Planning
- Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- On Nonlinear Fractional Programming
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Best Rational Approximation and Strict Quasi-Convexity
This page was built for publication: Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
