The following pages link to Generalized convex set functions (Q1122501):
Displaying 5 items.
- On a general duality model in multiobjective fractional programming with \(n\)-set functions (Q646115) (← links)
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions (Q819625) (← links)
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions (Q1609081) (← 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)
- Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
