Introduction: New approaches to linear programming
From MaRDI portal
Recommendations
- An algorithm for solving nonlinear programming problems using Karmarkar's technique
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
- scientific article; zbMATH DE number 1226308
- A variable-metric variant of the Karmarkar algorithm for linear programming
- scientific article; zbMATH DE number 4158373
Cites work
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- A feasible direction method for linear programming
- A modification of Karmarkar's linear programming algorithm
- A monotonic projective algorithm for fractional linear programming
- A multiplicative barrier function method for linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial Newton method for linear programming
- A projective method for linear programming with box-type constraints
- A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- Homotopy techniques in linear programming
- Normal solutions of linear programs
- The iterative step in the linear programming algorithm of N. Karmarkar
Cited in
(12)- scientific article; zbMATH DE number 3918118 (Why is no real title available?)
- Interior path following primal-dual algorithms. I: Linear programming
- Differential-algebraic approach to linear programming
- scientific article; zbMATH DE number 3858832 (Why is no real title available?)
- Implementing conflict resolution
- A unified view of interior point methods for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Linear programming and the Newton barrier flow
- Insights into the interior-point methods
- An algorithm for solving nonlinear programming problems using Karmarkar's technique
- Asymptotic behaviour of Karmarkar's method for linear programming
This page was built for publication: Introduction: New approaches to linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088596)