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

Alexander Engau and Miguel F. Anjos

Article (2017)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/38329/
Journal Title:	Optimization (vol. 66, no. 12)
Publisher:	Taylor & Francis
DOI:	10.1080/02331934.2016.1244268
Official URL:	https://doi.org/10.1080/02331934.2016.1244268
Date Deposited:	18 Apr 2023 15:04
Last Modified:	07 May 2025 08:59

Cite in APA 7:	Engau, A., & Anjos, M. F. (2017). Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities. Optimization, 66(12), 2063-2086. https://doi.org/10.1080/02331934.2016.1244268
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Dimensions

Repository Staff Only

View Item