The Basic George B. Dantzig Book

	Preface
	Acknowledgments
I	Mathematical Statistics	1
1	On the nonexistence of tests of "Students" hypothesis having power functions independent of [omega]	3
2	On the fundamental lemma of Neyman and Pearson	10
II	The Simplex Method of Linear Programming	19
3	Programming in a linear structure	23
4	Maximization of a linear function of variables subject to linear inequalities	24
5	The generalized simplex method for minimizing a linear form under linear inequality restraints	33
III	Large-Scale Linear Programming	45
6	Upper bounds, secondary constraints, and block triangularity in linear programming	49
7	Decomposition principle for linear programs	61
8	Generalized upper bounding techniques	72
IV	Special Applications and Economic Modeling	89
9	Minimizing the number of tankers to meet a fixed schedule	91
10	A linear programming approach to the chemical equilibrium problem	98
11	Formulating an objective for an economy	105
V	Linear Programming under Uncertainty	129
12	Linear programming under uncertainty	131
13	On the solution of two-stage linear programs under uncertainty	143
14	Parallel processors for planning under uncertainty	157
15	Multi-stage stochastic linear programs for portfolio optimization	180
VI	Network Optimization	201
16	Solution of a large-scale traveling-salesman problem	205
17	On the max-flow min-cut theorem of networks	225
18	On the shortest route through a network	232
VII	Integer Linear Programming and Linear Inequalities	237
19	On the significance of solving linear programming problems with some integer variables	239
20	Fourier-Motzkin elimination and its dual	255
VIII	Nonlinear Programming	265
21	Quadratic programming	267
22	On the continuity of the minimum set of a continuous function	276
IX	Complementarity Problems	305
23	Complementary pivot theory of mathematical programming	307
24	A generalization of the linear complementarity problem	328
	Editor's Notes	341
	Publications of George B. Dantzig	353
	Index	367