This book discusses the basic theory, algorithms, and recent developments of linear programming from both theoretical and applied perspectives, with particular emphasis on solving large‑scale linear programming problems. The book consists of ten chapters: Introduction to Linear Programming; The Simplex Method; Improved Forms of the Simplex Method; Duality; Sensitivity Analysis and Parametric Programming; Decomposition of Large‑Scale Problems; Transportation and Assignment Problems; Network Flows; Advances and Industrial Applications of the Simplex Method; and Interior Point Methods for Linear Programming. Each chapter includes exercises for readers to study and practice.This book can serve as a textbook for graduate and undergraduate students in management science, systems engineering, and related disciplines, and may also be used as a reference for teachers, researchers, and practitioners in management.