scientific article; zbMATH DE number 1150439

MaRDI QIDQ4388682zbMATH OpenFDO

Authors Xin-Ming Lu

Publication date 7 May 1998

zbMATH Keywords

inequality constraintssimplex methodinterior algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• A Low Complexity Interior-Point Algorithm for Linear Programming
• A new polynomial-time algorithm for linear programming
• New trajectory-following polynomial-time algorithm for linear programming problems
• On the finite convergence of interior-point algorithms for linear programming

Cited in

(6)

• A Low Complexity Interior-Point Algorithm for Linear Programming
• scientific article; zbMATH DE number 4097127 (Why is no real title available?)
• Solving a linear multiperiod portfolio problem by interior-point methodology
• scientific article; zbMATH DE number 1383435 (Why is no real title available?)
• The complex interior-boundary method for linear and nonlinear programming with linear constraints
• On the equivalence of the simplex methods and a multiplier-alike method for linear programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388682)