Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities

Alexander Engau, Miguel F. Anjos

Résultat de recherche: Articleexamen par les pairs

Empreinte numérique

Plonger dans les sujets de recherche 'Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities'. Ensemble, ils forment une empreinte numérique unique.

Mathematics

Business & Economics

Engineering & Materials Science