Pages that link to "Item:Q1123816"
From MaRDI portal
The following pages link to Convergence of interval-type algorithms for generalized fractional programming (Q1123816):
Displaying 29 items.
- Farkas-type results for constrained fractional programming with DC functions (Q479261) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem (Q857834) (← links)
- Revisiting Dinkelbach-type algorithms for generalized fractional programs (Q1021012) (← links)
- Generic algorithm for generalized fractional programming (Q1029285) (← links)
- Algorithms for generalized fractional programming (Q1181731) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Processors selection and traffic splitting in a parallel processors system (Q1203599) (← links)
- Dual method of centers for solving generalized fractional programs (Q1679491) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- A new algorithm for generalized fractional programs (Q1919091) (← links)
- Using duality to solve generalized fractional programming problems (Q1924069) (← 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)
- 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)
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint (Q2829557) (← links)
- Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control (Q4256100) (← links)
- A Fourth bibliography of fractional programming (Q4327876) (← links)
- A proximal point algorithm for generalized fractional programs (Q4559394) (← links)
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program (Q4578155) (← links)
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions (Q4764579) (← links)
- Continuous-time generalized fractional programming (Q4893696) (← links)
- A DC approach for minimax fractional optimization programs with ratios of convex functions (Q5038436) (← links)
- Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)
- Method of centers for generalized fractional programming (Q5925737) (← links)
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming (Q6569145) (← links)
- Successive upper approximation methods for generalized fractional programs (Q6658432) (← links)
