On the convexity of the multiplicative version of Karmarkar's potential function (Q1111466): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A multiplicative barrier function method for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on degeneracy in linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank | |||
Normal rank | |||
Latest revision as of 10:48, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convexity of the multiplicative version of Karmarkar's potential function |
scientific article |
Statements
On the convexity of the multiplicative version of Karmarkar's potential function (English)
0 references
1988
0 references
The author shows that the multiplicative version of the potential function is strictly convex on the feasible region of the corresponding linear programming problem when the region is bounded, as is the case in the multiplicative version of Karmarkar's potential function.
0 references
strict convexity
0 references
multiplicative version of the potential function
0 references
Karmarkar's potential function
0 references
