ONE: INTRODUCTION TWO: LINEAR ALGEBRA, CONVEX ANALYSIS, AND POLYHEDRAL SETS THREE: THE SIMPLEX METHOD FOUR: STARTING SOLUTION AND CONVERGENCE FIVE: SPECIAL SIMPLEX IMPLEMENTATIONS AND OPTIMALITY CONDITIONS SIX: DUALITY AND SENSITIVITY ANALYSIS SEVEN: THE DECOMPOSITION PRINCIPLE EIGHT: COMPLEXITY OF THE SIMPLEX ALGORITHM AND POLYNOMIAL-TIME ALGORITHMS NINE: MINIMAL-COST NETWORK FLOWS TEN: THE TRANSPORTATION AND ASSIGNMENT PROBLEMS ELEVEN: THE OUT-OF-KILTER ALGORITHM TWELVE: MAXIMAL FLOW, SHORTEST PATH, MULTICOMMODITY FLOW, AND NETWORK SYNTHESIS PROBLEMS |