Pages that link to "Item:Q1922695"
From MaRDI portal
The following pages link to An interior-point method for generalized linear-fractional programming (Q1922695):
Displayed 20 items.
- Maximal and supremal tolerances in multiobjective linear programming (Q257229) (← links)
- Radii of solvability and unsolvability of linear systems (Q277137) (← links)
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- Robust optimal solutions in interval linear programming with forall-exists quantifiers (Q323404) (← links)
- Additive and multiplicative tolerance in multiobjective linear programming (Q943806) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- The finite criss-cross method for hyperbolic programming (Q1809838) (← links)
- On polynomiality of the method of analytic centers for fractional problems (Q1919100) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- EIV regression with bounded errors in data: total `least squares' with Chebyshev norm (Q2175654) (← links)
- An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
- Generalized linear fractional programming under interval uncertainty (Q2270292) (← links)
- An effective branch and bound algorithm for minimax linear fractional programming (Q2336179) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Regularity radius: Properties, approximation and a not a priori exponential algorithm (Q4615523) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem (Q6098133) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)