Pages that link to "Item:Q2935390"
From MaRDI portal
The following pages link to A new linearization technique for minimax linear fractional programming (Q2935390):
Displaying 15 items.
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems (Q445341) (← links)
- Interval linear fractional programming: optimal value range of the objective function (Q827356) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- A new branch and bound algorithm for minimax ratios problems (Q2364779) (← links)
- (Q3175206) (← links)
- Branch and bound computation of the minimum norm of a linear fractional transformation over a structured set (Q4507047) (← links)
- Equivalence of various linearization algorithms for linear fractional programming (Q4731017) (← links)
- Methods for solving stochastic bilinear fractional max-min problems (Q4888151) (← links)
- A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints (Q5057970) (← links)
- (Q5432773) (← links)
- Interval division and linearization algorithm for minimax linear fractional program (Q6140900) (← 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)
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)
