scientific article; zbMATH DE number 1150439

zbMATH Open0902.90123MaRDI QIDQ4388682FDOQ4388682

Authors: Xin-Ming Lu 

Publication date: 7 May 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

inequality constraintssimplex methodinterior algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (6)

• Title not available (Why is that?)
• On the equivalence of the simplex methods and a multiplier-alike method for linear programming
• Title not available (Why is that?)
• Solving a linear multiperiod portfolio problem by interior-point methodology
• A Low Complexity Interior-Point Algorithm for Linear Programming
• The complex interior-boundary method for linear and nonlinear programming with linear constraints

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)