On the convexity of the multiplicative version of Karmarkar's potential function
- 1 January 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 40 (1) , 29-32
- https://doi.org/10.1007/bf01580721
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A multiplicative barrier function method for linear programmingAlgorithmica, 1986
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984