Pages that link to "Item:Q580191"
From MaRDI portal
The following pages link to A monotonic projective algorithm for fractional linear programming (Q580191):
Displaying 43 items.
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming (Q806962) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- On the improvement per iteration in Karmarkar's algorithm for linear programming (Q918862) (← links)
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- Karmarkar's algorithm and the ellipsoid method (Q1095025) (← links)
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value (Q1103522) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope (Q1106099) (← links)
- Computing Karmarkar projections quickly (Q1107438) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- Conical projection algorithms for linear programming (Q1117835) (← links)
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- Interior point algorithms for linear programming with inequality constraints (Q1181732) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A combined phase I-phase II scaled potential algorithm for linear programming (Q1181908) (← links)
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming (Q1194852) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
- An interior-point method for fractional programs with convex constraints (Q1804653) (← links)
- The finite criss-cross method for hyperbolic programming (Q1809838) (← links)
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm (Q1919098) (← links)
- On polynomiality of the method of analytic centers for fractional problems (Q1919100) (← links)
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
- Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)
- Search directions for interior linear-programming methods (Q2639771) (← links)
- El metodo de Karmarkar: Un estudio de sus variantes (Q3360002) (← links)
