A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD

DOI10.15807/JORSJ.31.413MaRDI QIDQ3807876zbMATH OpenOpenAlexFDO

Authors Akihisa Tamura, Hitoshi Takehara, Komei Fukuda, Satoru Fujishige, Masakazu Kojima

Publication date 1988

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.31.413

zbMATH Keywords

interior point methoddual interior primal simplex methodhybrid computational method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Interior dual proximal point algorithm for linear programs
• A primal-dual simplex method for linear programs
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
• scientific article; zbMATH DE number 4164543

Cited in

(9)

• Efficiency of the dual simplex method for solving systems of linear inequalities
• Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
• scientific article; zbMATH DE number 1489800 (Why is no real title available?)
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• Improving a primal–dual simplex-type algorithm using interior point methods
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
• Pivot rules for linear programming: A survey on recent theoretical developments
• A Dual Simplex Algorithm for Piecewise-Linear Programming
• Computational experience with a primal-dual interior point method for linear programming

This page was built for publication: A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD

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