The Fundamental Theorem of Linear Programming (LP) Can Best Be

Multiple Choice

The fundamental theorem of linear programming (LP) can best be described as

A) the theoretical foundation of a pioneering aggregate-planning model that uses nonlinear costs for its resource constraints.
B) a basic condition derived from the mathematical nature of the linear programming model that states there cannot be more active variables than real constraints.
C) a sensitivity threshold limiting the investigation of the effects of altering supply capacities and demand requirements for aggregate planning.
D) a search limitation on finding the minimum total cost along the scale that starts with smooth production and ends with perfect matching of supply and demand.