The Linear Programming Solver OverviewGetting StartedSyntaxDetailsExamplesReferences Examples: LP Solver Subsections: 13.1 Diet Problem 13.2 Reoptimizing the Diet Problem Using BASIS=WARMSTART 13.3 Two-Person Zero-Sum Game 13.4 Finding an Irreducible Infeasible Set 13.5 Using the Network Simplex Algorithm 13.6 Migration to OPTMODEL: Generalized Networks 13.7 Migration to OPTMODEL: Maximum Flow 13.8 Migration to OPTMODEL: Production, Inventory, Distribution 13.9 Migration to OPTMODEL: Shortest Path 13.10 Sensitivity Analysis Last updated: September 09, 2026