scientific article; zbMATH DE number 4170640

zbMATH Open0711.90053MaRDI QIDQ3496153FDOQ3496153

Authors: E. G. Gol'Shtejn, Arkadi Nemirovski, Yuri Nesterov 

Publication date: 1990

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

Recommendations

• scientific article; zbMATH DE number 4049377
• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 4016589
• scientific article; zbMATH DE number 4062817
• scientific article; zbMATH DE number 4062814

zbMATH Keywords

surveypolynomial algorithmsregularized problempath-following methodsnonrigid formulation

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Decomposition methods (49M27)

Cited In (7)

• A regularized simplex method
• Le traitement des solutions quasi optimales en programmation linéaire continue : une synthèse
• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical inclusion of optimum point for linear programming
• A new view of some fundamental results in optimization
• Title not available (Why is that?)

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 Q3496153)