In a linear programming problem, the objective function was specified as follows:
Z = 2 A + 4 B + 3 C
The optimal solution calls for A to equal 4, B to equal 6, and C to equal 3. It has also been determined that the coefficient associated with A can range from 1.75 to 2.25 without the optimal solution changing. This range is called A's
A)range of optimality.
B)range of feasibility.
C)shadow price.
D)slack.
E)surplus.

Question

Quizplus · Accepted Answer

The range within which the coefficient of a variable in the objective function can change without altering the optimal solution is known as the variable's range of optimality.

In a Linear Programming Problem, the Objective Function Was Specified