Pages that link to "Item:Q2355075"

The following pages link to Strong duality for robust minimax fractional programming problems (Q2355075):

Displaying 10 items.

• A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
• Robust fractional programming (Q493047) (← links)
• Interval linear fractional programming: optimal value range of the objective function (Q827356) (← links)
• A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
• Twin minimax probability machine for pattern classification (Q2057726) (← links)
• On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data (Q2067760) (← links)
• Optimal value bounds in interval fractional linear programming and revenue efficiency measuring (Q2201303) (← links)
• A new branch and bound algorithm for minimax ratios problems (Q2364779) (← links)
• Some characterizations of robust optimal solutions for uncertain fractional optimization and applications (Q2628185) (← links)
• A new linearization technique for minimax linear fractional programming (Q2935390) (← links)