Linear programming, complexity. Separation and optimization.

MaRDI QIDQ1612911zbMATH OpenFDO

Authors Jean-François Maurras

Publication date 5 September 2002

Published in Mathématiques \& Applications (Berlin) (Search for Journal in Brave)

zbMATH Keywords

linear programmingTuring machinecomplexity analysisalgorithmic complexityellipsoid method

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx)

Recommendations

• scientific article; zbMATH DE number 19091
• scientific article; zbMATH DE number 898014
• Linear programming, complexity theory and elementary functional analysis
• scientific article; zbMATH DE number 3744911
• scientific article; zbMATH DE number 3920182
• scientific article; zbMATH DE number 2005717
• Linear and nonlinear programming.
• scientific article; zbMATH DE number 1234104
• Linear programming. Foundations and extensions

This page was built for publication: Linear programming, complexity. Separation and optimization.

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