A comparison of the primal‐simplex and complementary pivot methods for linear programming (Q5668237): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800200109 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028887049 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:26, 12 June 2024
scientific article; zbMATH DE number 3402353
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of the primal‐simplex and complementary pivot methods for linear programming |
scientific article; zbMATH DE number 3402353 |
Statements
A comparison of the primal‐simplex and complementary pivot methods for linear programming (English)
0 references
1973
0 references
