Skip to page content

Objective Analysis. Effective Solutions.

Site-wide navigation

About RAND
RAND Campaign
Press Room
Careers

Research
Research Areas
Trending Topics
All Topics Browse Reports
Research Divisions
Research Departments
Latest Insights
Reports
Is the Market for AI Foundation Models a Natural Monopoly?

Enabling Human Security from Space
Commentary and Articles
The U.S Housing Crisis: What Americans Need to Know

Ukraine May Be Winning the Information War in Kursk
Multimedia
Climate Change and Critical Infrastructure: Assessing the Risks and Identifying Mitigation Strategies

The Policy Currents Podcast
Policy Experts
All Experts

Spotlight
- Raphael S. Cohen
  
  Commentary:
  
  Ukraine Needs a New Storyline
- Samuel Charap @scharap
  
  Commentary:
  
  How to Make the Most of the Kursk Gambit
By Research Area
Capabilities
Drawing upon decades of experience, RAND provides research services, systematic analysis, and innovative thinking to a global clientele that includes government agencies, foundations, and private-sector firms.
Capabilities Overview

RAND Solutions

Who We Work For

Public Sector

Philanthropic Sector

Private Sector

Work with Us

Explore Business Contacts

About RAND Research

Disciplinary Expertise

Quality Standards

Methodological Innovation
Featured Solutions
Getting to Know Military Caregivers and Their Needs

Managing Escalation in Crisis and War

Assessing and Articulating the Wider Benefits of Research

Improving Access to Early Childhood Education
Graduate School
The Pardee RAND Graduate School (PardeeRAND.edu) is home to the only Ph.D. and M.Phil. programs offered at an independent public policy research organization—the RAND Corporation.
Featured Video: Campus Tour

Student Life at Pardee RAND
Student Spotlight
- Karishma V. Patel
  
  Ph.D. Candidate, Pardee RAND Graduate School, and Assistant Policy Researcher, RAND
- Carlos A. Villegas
  
  Assistant Policy Researcher, RAND; Ph.D. Student, Pardee RAND Graduate School
About

中文(简体)
العربية
Cart

Site-wide Search

RAND
Research & Commentary
Browse by Author
D
>George Bernard Dantzig

George Bernard Dantzig

On a linear programming-combinatorial approach to the traveling salesman problem

2004
Linear Programming and Extensions

1963
Linear Programming in a Markov Chain: Notes on Linear Programming and Extensions — Part 59

1962
The decomposition algorithm for linear programming: Notes on linear programming and extensions-part 57

1961
Inductive proof of the simplex method.

1960
Solving the chemical equilibrium problem using the decomposition principle.

1960
Computing Tetraethyl Lead Requirements in the Linear Programming Format

1959
General convex objective forms.

1959
A machine-job scheduling model.

1959
A mathematical model of the human external respiratory system.

1959
New directions in mathematical programming.

1959
On the shortest route through a network.

1959
On the significance of solving linear-programming problems with some integer variables.

1959
The dual of a transportation problem is not a transportation problem.

1958
An equivalent linear-programming problem.

1958
Notes on Linear Programming: Part XLVII Solving Linear Programs in Integers

1958
On Integer and Partial Integer Linear Programming Problems

1958
Solving Two-Move Games with Perfect Information

1958
Chemical Equilibrium in Complex Mixtures

1957
Concepts, Origins, and Use of Linear Programming.

1957
On the status of multistage linear programming problems.

1957
Upper Bounded Variables in Linear Programming.

1957
The Central Mathematical Problem.

1956
Formulating a Linear Programming Model.

1956
Notes on Linear Programming: Part XXXV — Discrete-Variable Extremum Problems

1956
Notes on Linear Programming — Part XXXI: A Primal — Dual Algorithm

1956
The Simplex Method.

1956
Thoughts on Linear Programming and Automation.

1956
Linear Programming under Uncertainty.

1955
Notes on Linear Programming: Part XXII Recent Advances in Linear Programming

1955
On the Max Flow Min Cut Theorem of Networks.

1955
A Production Smoothing Problem.

1955
Constructive Proof of the Min-Max Theorem.

1954
Notes on Linear Programming: Part XVIII Status of Solution of Large-Scale Linear-Programming Problems

1954
Notes on Linear Programming: Part I: The Generalized Simplex Method for Minimizing a Linear Form Under Linear Inequality Restraints

1954
Notes on Linear Programming: Part VII The Dual Simplex Algorithm

1954
Notes on Linear Programming: Parts VIII, IX, and X Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

1954
Notes on Linear Programming: Part XV Minimizing the Number of Carriers to Meet a Fixed Schedule

1954
Notes on Linear Programming: Part XI Composite Simplex — Dual Simplex Algorithm — I

1954
Notes on Linear Programming—Part V: A Product-Form Tableau for Revised Simplex Method: Computing Appendix for RM-1268

1954
The Problem of Routing Aircraft--A Mathematical Solution.

1954
Solution of a Large-Scale Traveling-Salesman Problem

1954
Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

1954
Notes on Linear Programming: Part II Duality Theorems

1953
Notes on Linear Programming: Part V Alternate Algorithm for the Revised Simplex Method Using a Product Form for the Inverse

1953
Notes on Linear Programming — Part III: Computational Algorithm of the Revised Simplex Method

1953
The Product Form for the Inverse in the Simplex Method.

1953
Algorithm for computing optimum distribution of local defense.

1952
Comments on J. Von Neumann's "The Problem of Optimal Assignment on a Two-Person Game"

1952

About RAND Reports

Quality Standards
Publishing Overview
Ordering Information
Reprint & Linking Permissions
Publication Contact Information
Explore
- By Author
- By Series

About

RAND is a research organization that develops solutions to public policy challenges to help make communities throughout the world safer and more secure, healthier and more prosperous. RAND is nonprofit, nonpartisan, and committed to the public interest.

RAND History
Diversity, Equity, and Inclusion
Leadership
Research Integrity
Career Opportunities

Connect

Contact Us
Locations

I am interested in

Jobs at RAND
Media Resources
Congressional Resources
Doing Business with RAND
Supporting RAND
Educational Opportunities
Alumni Association

Follow

RAND on LinkedIn
RAND on Twitter
RAND on Facebook
RAND on YouTube
RAND on Instagram

Stay Informed

Subscribe to the Policy Currents newsletter for RAND insights on the issues that matter most.

Stay Informed

Policy Currents newsletter

Get updates from RAND delivered straight to your inbox.

Email

View all email newsletters

Resources

Multimedia
Latest Reports
Browse by Author
RAND Classics
Databases and Tools

Site Information

Site Map
PRIVACY POLICY
Support Policy
Feedback
Help

1776 Main Street
Santa Monica, California 90401-3208

RAND® is a registered trademark. © 2024 RAND Corporation. This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.