Pages that link to "Item:Q2417295"
From MaRDI portal
The following pages link to Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295):
Displaying 3 items.
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems (Q2657552) (← links)
- Optimality criteria for sum of fractional multiobjective optimization problem with generalized invexity (Q5740008) (← links)