Pages that link to "Item:Q1924069"
From MaRDI portal
The following pages link to Using duality to solve generalized fractional programming problems (Q1924069):
Displaying 16 items.
- On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
- Duality for multiobjective fractional programming problem using convexifactors (Q387092) (← links)
- Robust duality for fractional programming problems with constraint-wise data uncertainty (Q658562) (← links)
- Linear programming system identification (Q706953) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- Dual method of centers for solving generalized fractional programs (Q1679491) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- Enhanced bisection strategies for the maximin efficiency ratio model (Q1869406) (← links)
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints (Q2143822) (← links)
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions (Q2230768) (← links)
- An effective branch and bound algorithm for minimax linear fractional programming (Q2336179) (← links)
- Strong duality for robust minimax fractional programming problems (Q2355075) (← links)
- Prox-dual regularization algorithm for generalized fractional programs (Q2411175) (← links)
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution (Q2691342) (← links)
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program (Q4578155) (← links)
