{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "dantzig-simplex-1947",
    "title": "Dantzig: the simplex method for linear programming",
    "summary": "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.",
    "boundary": "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.",
    "area": "Optimization and operations research",
    "year": 1947,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "dantzig-simplex-1947",
    "target": {
      "record_id": "urn:uuid:c3d66544-2a89-4d96-a47f-3a9ea61eed07",
      "version": 1,
      "content_hash": "sha256:72bba67c9dc44f87d18ed1cd2075653a46b3f5920d5fb4e059450e14d4531902"
    },
    "humans": [
      "George B. Dantzig"
    ],
    "authors_complete": true,
    "human_role_note": "The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cowles-dantzig-linear-programming",
        "title": "Dantzig, Maximization of a Linear Function of Variables Subject to Linear Inequalities",
        "url": "https://cowles.yale.edu/sites/default/files/2022-09/m13-all.pdf"
      },
      {
        "id": "computerhistory-dantzig-simplex-origins",
        "title": "Dantzig, Origins of the Simplex Method",
        "url": "https://archive.computerhistory.org/resources/access/text/2024/06/102739347-05-0002-acc.pdf"
      },
      {
        "id": "stanford-dantzig-timeline",
        "title": "Stanford MS&E history timeline: Dantzig and the simplex method",
        "url": "https://msande.stanford.edu/timeline-mses-history"
      }
    ],
    "geography": {
      "country_codes": [
        "US"
      ],
      "location_basis": "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.",
      "source_url": "https://archive.computerhistory.org/resources/access/text/2024/06/102739347-05-0002-acc.pdf",
      "target": {
        "record_id": "urn:uuid:c3d66544-2a89-4d96-a47f-3a9ea61eed07",
        "version": 1,
        "content_hash": "sha256:72bba67c9dc44f87d18ed1cd2075653a46b3f5920d5fb4e059450e14d4531902"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://archive.computerhistory.org/resources/access/text/2024/06/102739347-05-0002-acc.pdf"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "260000",
    "published_grade": {
      "id": "dantzig-simplex-1947",
      "entry_id": "dantzig-simplex-1947",
      "band": "A",
      "modifier": "+",
      "target": {
        "record_id": "urn:uuid:c3d66544-2a89-4d96-a47f-3a9ea61eed07",
        "version": 1,
        "content_hash": "sha256:72bba67c9dc44f87d18ed1cd2075653a46b3f5920d5fb4e059450e14d4531902"
      },
      "what_changed": "A general-purpose procedure made linear-programming optimization computationally tractable in practice.",
      "scope": "1947 development and early method; not sole invention of linear programming, duality or later algorithm variants.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:c3d66544-2a89-4d96-a47f-3a9ea61eed07",
        "version": 1,
        "content_hash": "sha256:72bba67c9dc44f87d18ed1cd2075653a46b3f5920d5fb4e059450e14d4531902"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-09-25T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "George B. Dantzig",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Dantzig, Maximization of a Linear Function of Variables Subject to Linear Inequalities",
            "url": "https://cowles.yale.edu/sites/default/files/2022-09/m13-all.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Dantzig, Maximization of a Linear Function of Variables Subject to Linear Inequalities",
            "url": "https://cowles.yale.edu/sites/default/files/2022-09/m13-all.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Dantzig, Origins of the Simplex Method",
            "url": "https://archive.computerhistory.org/resources/access/text/2024/06/102739347-05-0002-acc.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-2",
          "kind": "source_reference",
          "source": {
            "citation": "Stanford MS&E history timeline: Dantzig and the simplex method",
            "url": "https://msande.stanford.edu/timeline-mses-history"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "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.",
        "domain": "Optimization and operations research"
      },
      "sources": [
        {
          "citation": "Dantzig, Maximization of a Linear Function of Variables Subject to Linear Inequalities",
          "url": "https://cowles.yale.edu/sites/default/files/2022-09/m13-all.pdf"
        },
        {
          "citation": "Dantzig, Origins of the Simplex Method",
          "url": "https://archive.computerhistory.org/resources/access/text/2024/06/102739347-05-0002-acc.pdf"
        },
        {
          "citation": "Stanford MS&E history timeline: Dantzig and the simplex method",
          "url": "https://msande.stanford.edu/timeline-mses-history"
        }
      ],
      "statement": "# Dantzig: the simplex method for linear programming\n\nDeveloped the simplex method for moving among feasible vertices to optimize a linear objective under linear constraints, in the linear-programming programme begun in 1947.\n\n## Scientific scope\n\nThis record is scoped to Dantzig’s simplex method and early formulation. Precursor elimination methods, later variants, complexity theory and interior-point algorithms remain separate.\n\n## Reading status\n\nThis 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.\n\n## People and systems\n\nGeorge B. Dantzig\n\nThe named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.\n\n\n\n## Original sources\n\n- [Dantzig, Maximization of a Linear Function of Variables Subject to Linear Inequalities](https://cowles.yale.edu/sites/default/files/2022-09/m13-all.pdf)\n- [Dantzig, Origins of the Simplex Method](https://archive.computerhistory.org/resources/access/text/2024/06/102739347-05-0002-acc.pdf)\n- [Stanford MS&E history timeline: Dantzig and the simplex method](https://msande.stanford.edu/timeline-mses-history)\n",
      "summary": "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.",
      "title": "Dantzig: the simplex method for linear programming"
    },
    "record_id": "urn:uuid:c3d66544-2a89-4d96-a47f-3a9ea61eed07",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:c3d66544-2a89-4d96-a47f-3a9ea61eed07",
      "version": 1,
      "content_hash": "sha256:72bba67c9dc44f87d18ed1cd2075653a46b3f5920d5fb4e059450e14d4531902"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:6d17018bd785f6382c4ddc7016e6563a283051c6cef79f2378ebd8331db65205"
  },
  "target": {
    "record_id": "urn:uuid:c3d66544-2a89-4d96-a47f-3a9ea61eed07",
    "version": 1,
    "content_hash": "sha256:72bba67c9dc44f87d18ed1cd2075653a46b3f5920d5fb4e059450e14d4531902"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "dantzig-simplex-1947",
    "entry_id": "dantzig-simplex-1947",
    "revision": 1,
    "title": "Dantzig: the simplex method for linear programming",
    "context": "Mathematics and computing",
    "track": "Optimization algorithm",
    "band": "A",
    "modifier": "+",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-25",
    "evidence_cutoff": "2026-09-25",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "A general-purpose procedure made linear-programming optimization computationally tractable in practice.",
    "scope": "1947 development and early method; not sole invention of linear programming, duality or later algorithm variants.",
    "evidence_summary": "The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. 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.",
    "references": [
      {
        "title": "Dantzig, Origins of the Simplex Method",
        "url": "https://archive.computerhistory.org/resources/access/text/2024/06/102739347-05-0002-acc.pdf",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      },
      {
        "title": "Dantzig, Maximization of a Linear Function of Variables Subject to Linear Inequalities",
        "url": "https://cowles.yale.edu/sites/default/files/2022-09/m13-all.pdf",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      },
      {
        "title": "Stanford MS&E history timeline: Dantzig and the simplex method",
        "url": "https://msande.stanford.edu/timeline-mses-history",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      }
    ],
    "roles": [
      {
        "who": "George B. Dantzig",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:c3d66544-2a89-4d96-a47f-3a9ea61eed07",
      "version": 1,
      "content_hash": "sha256:72bba67c9dc44f87d18ed1cd2075653a46b3f5920d5fb4e059450e14d4531902"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "260000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}