Pages that link to "Item:Q6050611"
From MaRDI portal
The following pages link to Efficient algorithm for globally computing the min–max linear fractional programming problem (Q6050611):
Displaying 4 items.
- An effective branch and bound algorithm for minimax linear fractional programming (Q2336179) (← links)
- A global optimization algorithm for linear fractional programming (Q2378922) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)
- Global algorithm for effectively solving min-max affine fractional programs (Q6584742) (← links)