An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope (Q1106099)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope |
scientific article; zbMATH DE number 4060992
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope |
scientific article; zbMATH DE number 4060992 |
Statements
An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope (English)
0 references
1988
0 references
The author presents an algorithm analogous to Karmarkar's for the linear programming problem which works directly in the space of linear inequalities. The main idea is to use the projective transformation on the feasible region that maps the current iterate to the center of the transformed feasible region.
0 references
Karmarkar's algorithm
0 references
projective transformation
0 references
center of the transformed feasible region
0 references
