A complexity reduction for the long-step path-following algorithm for linear programming

D. den Hertog, C. Roos, J.-Ph. Vial

Research output: Contribution to journalArticleScientificpeer-review

9 Downloads (Pure)
Original languageEnglish
Pages (from-to)71-87
Number of pages17
JournalSIAM Journal on Optimization
Volume2
Issue number1
Publication statusPublished - 1992
Externally publishedYes

Cite this

@article{93c87917943643a688137cf1c2fe5f02,
title = "A complexity reduction for the long-step path-following algorithm for linear programming",
author = "{den Hertog}, D. and C. Roos and J.-Ph. Vial",
note = "Pagination: 17",
year = "1992",
language = "English",
volume = "2",
pages = "71--87",
journal = "SIAM Journal on Optimization",
issn = "1052-6234",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

A complexity reduction for the long-step path-following algorithm for linear programming. / den Hertog, D.; Roos, C.; Vial, J.-Ph.

In: SIAM Journal on Optimization, Vol. 2, No. 1, 1992, p. 71-87.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A complexity reduction for the long-step path-following algorithm for linear programming

AU - den Hertog, D.

AU - Roos, C.

AU - Vial, J.-Ph.

N1 - Pagination: 17

PY - 1992

Y1 - 1992

M3 - Article

VL - 2

SP - 71

EP - 87

JO - SIAM Journal on Optimization

JF - SIAM Journal on Optimization

SN - 1052-6234

IS - 1

ER -