The following pages link to (Q4312260):
Displaying 9 items.
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions (Q819625) (← links)
- Duality for a minimax programming problem containing \(n\)-set functions (Q1279952) (← links)
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions (Q1378572) (← links)
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions (Q1378590) (← links)
- A note on fractional minmax programs containing \(n\)-set functions (Q1378606) (← links)
- Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions (Q1827235) (← links)
- On minimax fractional programming of generalized convex set functions (Q1978809) (← links)
- Duality for generalized fractional programs involving n-set functions (Q2276888) (← links)
- Duality relations for generalized fractional programming involving \(n\)-set functions (Q2565321) (← links)
