Pages that link to "Item:Q1804653"

The following pages link to An interior-point method for fractional programs with convex constraints (Q1804653):

Displaying 11 items.

• The long-step method of analytic centers for fractional problems (Q1373735) (← links)
• On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← links)
• An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
• An interior-point method for generalized linear-fractional programming (Q1922695) (← links)
• An effective branch and bound algorithm for minimax linear fractional programming (Q2336179) (← links)
• A new branch and bound algorithm for minimax ratios problems (Q2364779) (← links)
• A fifth bibliography of fractional programming^* (Q4265528) (← links)
• Minisymposium 2 : Optimierung (Q4306791) (← links)
• A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints (Q5057970) (← links)
• A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming (Q6569145) (← links)
• Global algorithm for effectively solving min-max affine fractional programs (Q6584742) (← links)