Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions

DOI10.1016/S0898-1221(03)00134-2zbMath1055.90075OpenAlexW2088787685MaRDI QIDQ1827235

G. J. Zalmai

Publication date: 6 August 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(03)00134-2

zbMATH Keywords

Sufficient optimality conditionsDuality theoremsGeneralized \(n\)-set convex functionsMinmax fractional subset programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Programming in abstract spaces (90C48)

Related Items (4)

Nondifferentiable minimax programming problems with applications ⋮ \(E\)-differentiable minimax programming under \(E\)-convexity ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions ⋮ A sixth bibliography of fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• 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 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
• Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions
• Duality for generalized fractional programs involving n-set functions
• Duality relations for generalized fractional programming involving \(n\)-set functions
• 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
• Seven Kinds of Convexity
• The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
• Best Rational Approximation and Strict Quasi-Convexity

This page was built for publication: Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions