Pages that link to "Item:Q852112"
From MaRDI portal
The following pages link to Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios (Q852112):
Displaying 9 items.
- Robust fractional programming (Q493047) (← links)
- Some Farkas-type results for fractional programming problems with DC functions (Q1015085) (← links)
- Generic algorithm for generalized fractional programming (Q1029285) (← links)
- A taxonomy and review of the multi-objective fractional programming (MOFP) problems (Q1791870) (← links)
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints (Q2143822) (← links)
- A new branch and bound algorithm for minimax ratios problems (Q2364779) (← links)
- Farkas-type results for fractional programming problems (Q2371162) (← links)
- A new linearization technique for minimax linear fractional programming (Q2935390) (← links)
- Interval division and linearization algorithm for minimax linear fractional program (Q6140900) (← links)
