The following pages link to (Q3820394):
Displaying 6 items.
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions (Q819625) (← links)
- Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms (Q874317) (← 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)
- A new algorithm for generalized fractional programs (Q1919091) (← links)
- Using duality to solve generalized fractional programming problems (Q1924069) (← links)
- Generalized parameter-free duality models in discrete minmax fractional programming based on second-order optimality conditions (Q2398023) (← links)
