An adaptation of the dual-affine interior point method for the surface flatness problem

DOI10.1016/j.ejor.2006.03.036zbMath1123.90077OpenAlexW2049194959MaRDI QIDQ877663

Antonio Roberto Balbo, Edméa Cássia Baptista, Marcos Nereu Arenales

Publication date: 3 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.036

zbMATH Keywords

linear programminginterior point methodssurface flatness problemTchebyshev's norm

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• A new polynomial-time algorithm for linear programming
• Evaluation of straightness and flatness error using computational geometric techniques.
• An implementation of Karmarkar's algorithm for linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An adaptation of the dual-affine interior point method for the surface flatness problem