Linear Programming: Foundations and Extensions Book

	Preface
	Preface to 2nd Edition
Pt. 1	Basic Theory - The Simplex Method and Duality	1
Ch. 1	Introduction	3
Ch. 2	The Simplex Method	13
Ch. 3	Degeneracy	29
Ch. 4	Efficiency of the Simplex Method	45
Ch. 5	Duality Theory	55
Ch. 6	The Simplex Method in Matrix Notation	89
Ch. 7	Sensitivity and Parametric Analyses	111
Ch. 8	Implementation Issues	125
Ch. 9	Problems in General Form	151
Ch. 10	Convex Analysis	161
Ch. 11	Game Theory	173
Ch. 12	Regression	189
Pt. 2	Network-Type Problems	211
Ch. 13	Network Flow Problems	213
Ch. 14	Applications	241
Ch. 15	Structural Optimization	259
Pt. 3	Interior-Point Methods	275
Ch. 16	The Central Path	277
Ch. 17	A Path-Following Method	291
Ch. 18	The KKT System	307
Ch. 19	Implementation Issues	315
Ch. 20	The Affine-Scaling Method	333
Ch. 21	The Homogeneous Self-Dual Method	349
Pt. 4	Extensions	371
Ch. 22	Integer Programming	373
Ch. 23	Quadratic Programming	395
Ch. 24	Convex Programming	413
	Source Listings	425
	Answers to Selected Exercises	433
	Bibliography	435
	Index	443