Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm (Q4332254)
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: Publication:4332254 |
scientific article; zbMATH DE number 978050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm |
scientific article; zbMATH DE number 978050 |
Statements
Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm (English)
0 references
13 February 1997
0 references
following a trajectory
0 references
infeasible starting point
0 references
\(\beta\)-balanced solution
0 references
0.8083050847053528
0 references
0.8052623271942139
0 references
0.8052623271942139
0 references
0.7551770806312561
0 references
