Oil minmax programming problems containing n-set functions

DOI10.1080/02331939108843695zbMath0738.90064OpenAlexW2081448032MaRDI QIDQ3978528

Vasile C. Preda

Publication date: 25 June 1992

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843695

zbMATH Keywords

generalized convexitysufficient optimality conditionssublinear functionalsduality resultsLebesgue integrable functionsgeneralized fractional programmingfinite atomless measure space

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Fractional programming (90C32) Duality theory (optimization) (49N15) Optimality conditions for minimax problems (49K35) Convexity of real functions of several variables, generalizations (26B25)

Related Items (19)

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ A fifth bibliography of fractional programming^* ⋮ Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions ⋮ Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ On a general duality model in multiobjective fractional programming with \(n\)-set functions ⋮ Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions ⋮ Three types dual model for minimax fractional programming ⋮ On minimax fractional programming of generalized convex set functions ⋮ Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions ⋮ Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ Optimality for nonlinear programs containingn-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 ⋮ Duality for multiobjective fractional programming involvingn-set functions sup^* ⋮ Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions

Cites Work

• Unnamed Item
• Optimization theory for n-set functions
• Optimal constrained selection of a measurable subset
• Duality in mathematical programming of set functions: On Fenchel duality theorem
• On multiple objective programming problems with set functions
• Proper D-solutions of multiobjective programming problems with set functions
• Epigraphs of convex set functions
• 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
• Strong and Weak Convexity of Sets and Functions
• Second order optimality conditions for mathematical prograramming with set functions
• Saddle point and duality in the optimization theory of convex set functions
• Generalized convexity in mathematical programming
• A transposition theorem with applications to constrained optimal control problems
• Duality Relationships for a Partitioning Problem
• A Partitioning Problem with Applications in Regional Design
• On the Fundamental Lemma of Neyman and Pearson

This page was built for publication: Oil minmax programming problems containing n-set functions