Pages that link to "Item:Q1919091"

The following pages link to A new algorithm for generalized fractional programs (Q1919091):

Displaying 38 items.

• Augmented Lagrange primal-dual approach for generalized fractional programming problems (Q380509) (← links)
• Robust fractional programming (Q493047) (← links)
• Minimization of isotonic functions composed of Fractions (Q613584) (← links)
• Linear programming system identification (Q706953) (← links)
• An algorithm for generalized fractional programs (Q799495) (← links)
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
• Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios (Q852112) (← links)
• Revisiting Dinkelbach-type algorithms for generalized fractional programs (Q1021012) (← links)
• Solving the sum-of-ratios problem by a stochastic search algorithm (Q1024829) (← links)
• Generic algorithm for generalized fractional programming (Q1029285) (← links)
• Generalized fractional programming: Algorithms and numerical experimentation (Q1058468) (← links)
• A note on an algorithm for generalized fractional programs (Q1062921) (← links)
• Algorithms for generalized fractional programming (Q1181731) (← links)
• Global optimization of fractional programs (Q1186270) (← links)
• Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems (Q1304774) (← 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)
• Using duality to solve generalized fractional programming problems (Q1924069) (← links)
• Prox-regularization methods for generalized fractional programming (Q1969530) (← 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)
• 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)
• Saddle-point type optimality criteria and duality relations for generalized fractional programming. (Q2467817) (← links)
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution (Q2691342) (← links)
• A new approach for solving generalized linear fractional programming (Q2860426) (← links)
• Solution of some convex separable resource allocation and production planning problems with bounds on the variables (Q3008595) (← links)
• (Q3494400) (← links)
• A fifth bibliography of fractional programming^* (Q4265528) (← links)
• A Fast Algorithm for a Class of Generalized Fractional Programs (Q4363609) (← 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)
• Prox-regularization of the dual method of centers for generalized fractional programs (Q4631765) (← 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)
• 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)