Direct and dual minimal feasible methods for solving a general linear programming problem (Q1135196)
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: Direct and dual minimal feasible methods for solving a general linear programming problem |
scientific article; zbMATH DE number 3661094
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Direct and dual minimal feasible methods for solving a general linear programming problem |
scientific article; zbMATH DE number 3661094 |
Statements
Direct and dual minimal feasible methods for solving a general linear programming problem (English)
0 references
1977
0 references
general linear programming
0 references
minimal feasible solution
0 references
direct and dual problems
0 references
algorithms
0 references
suboptimal solutions
0 references
