What is recorded here?
Developed the simplex method for moving among feasible vertices to optimize a linear objective under linear constraints, in the linear-programming programme begun in 1947.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
This record is scoped to Dantzig’s simplex method and early formulation. Precursor elimination methods, later variants, complexity theory and interior-point algorithms remain separate.
Read the original work
- Dantzig, Maximization of a Linear Function of Variables Subject to Linear Inequalities
- Dantzig, Origins of the Simplex Method
- Stanford MS&E history timeline: Dantzig and the simplex method
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
George B. Dantzig
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: United States
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.
English catalogue narrative
Dantzig: the simplex method for linear programming
Developed the simplex method for moving among feasible vertices to optimize a linear objective under linear constraints, in the linear-programming programme begun in 1947.
Scientific scope
This record is scoped to Dantzig’s simplex method and early formulation. Precursor elimination methods, later variants, complexity theory and interior-point algorithms remain separate.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
George B. Dantzig
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.