Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:41, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming |
scientific article |
Statements
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (English)
0 references
28 June 1999
0 references
linear programming
0 references
Farkas lemma
0 references
infeasible-interior-point methods
0 references
stopping rules
0 references
