Transformations of dual problem and decreasing dimensions in linear programming

zbMATH Open1122.90386MaRDI QIDQ3377633FDOQ3377633

Authors: Nebojša V. Stojković, Predrag S. Stanimirović 

Publication date: 28 March 2006

Full work available at URL: https://eudml.org/doc/128078

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 2099402
• Finite termination and decreasing dimensions in Mehrotra's primal-dual algorithm
• Eliminating columns in the simplex method for linear programming
• On finite termination in the primal-dual method for linear programming
• scientific article; zbMATH DE number 1160769

zbMATH Keywords

primal-dual interior point methodspotential function

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51)

Cited In (3)

• Finite termination and decreasing dimensions in Mehrotra's primal-dual algorithm
• Title not available (Why is that?)
• Transformation of a multi-choice linear programming problem

Uses Software

• Mathematica

This page was built for publication: Transformations of dual problem and decreasing dimensions in linear programming

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