Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
From MaRDI portal
Publication:3833882
DOI10.1080/02331938908843457zbMath0677.90072OpenAlexW1966920512MaRDI QIDQ3833882
Publication date: 1989
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938908843457
optimality conditionsduality resultsLebesgue integrable functionsgeneralized fractional programmingfinite atomless measure spaceconstrained measurable subset selection problemsdiscrete minmax fractional objective functions
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Optimality conditions for minimax problems (49K35)
Related Items (15)
Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions ⋮ Nondifferentiable minimax programming problems with applications ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ A note on fractional minmax programs containing \(n\)-set functions ⋮ Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming ⋮ Three types dual model for minimax fractional programming ⋮ On minimax fractional programming of generalized convex set functions ⋮ Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions ⋮ Duality for generalized fractional programs involving n-set functions ⋮ Optimality and duality for multiobjective fractional programming involving \(n\)-set functions ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions ⋮ Unnamed Item ⋮ Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
Cites Work
- Optimization theory for n-set functions
- Optimal constrained selection of a measurable subset
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- An algorithm for generalized fractional programs
- On multiple objective programming problems with set functions
- Generalized fractional programming: Algorithms and numerical experimentation
- A note on an algorithm for generalized fractional programs
- Proper D-solutions of multiobjective programming problems with set functions
- Epigraphs of convex set functions
- Duality in generalized fractional programming via Farkas' lemma
- Extreme convex set functions with finite carrier: General theory
- Quelques résultats sur l'identification de domaines
- Application de la méthode des éléments finis à l'approximation d'un problème de domaine optimal. Méthodes de résolution des problèmes approches
- Goal programming and multiple objective optimizations. Part I
- Some properties of convex set functions
- Strong and Weak Convexity of Sets and Functions
- Duality in generalized linear fractional programming
- Second order optimality conditions for mathematical prograramming with set functions
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Global saddle-point duality for quasi-concave programs, II
- Bibliography in fractional programming
- Saddle point and duality in the optimization theory of convex set functions
- Generalized fractional programming duablity: a ratio game approach
- IX. On the problem of the most efficient tests of statistical hypotheses
- Duality in mathematical programming and some problems of convex analysis
- Duality Relationships for a Partitioning Problem
- A Partitioning Problem with Applications in Regional Design
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Best Rational Approximation and Strict Quasi-Convexity
- On the Fundamental Lemma of Neyman and Pearson
- Fractional programming
This page was built for publication: Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
