A note on fractional minmax programs containing \(n\)-set functions

DOI10.1006/jmaa.1997.5593zbMath0894.90141OpenAlexW2024868190MaRDI QIDQ1378606

Promila Kumar, Davinder Bhatia

Publication date: 9 February 1998

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1997.5593

zbMATH Keywords

sufficient optimality conditionsduality resultsgeneralized \(\rho\)-convexitygeneralized minmax fractional programming

Mathematics Subject Classification ID

Fractional programming (90C32) Programming in abstract spaces (90C48)

Related Items (6)

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions ⋮ Partial vector invexity for \(n\)-set functions and minmax programming ⋮ 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
• Sufficiency criteria and duality for nonlinear programs involving n-set functions
• Generalized fractional programming duality: A parametric approach
• Duality for generalized fractional programs involving n-set functions
• Duality in generalized linear fractional programming
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
• Generalized fractional programming duablity: a ratio game approach

This page was built for publication: A note on fractional minmax programs containing \(n\)-set functions