A maximization integer linear model is solved by first relaxing the integer restrictions, giving an optimal solution to the resulting linear model of X₁ = 6, X₂ = 11.The shadow price for the first constraint is $9, and the range of feasibility has a maximum increase of 20 and a maximum decrease of 5.Then for the integer model, X₁ = 6, X₂ = 11 is the optimal solution.If there is an increase of 3 units of the first resource, the optimal value of the objective function will increase by $27.

Question

Quizplus · Accepted Answer

The Answer of A maximization integer linear model is solved by first relaxing the integer restrictions, giving an optimal solution to the resulting linear model of X₁ = 6, X₂ = 11.The shadow price for the first constraint is $9, and the range of feasibility has a maximum increase of 20 and a maximum decrease of 5.Then for the integer model, X₁ = 6, X₂ = 11 is the optimal solution.If there is an increase of 3 units of the first resource, the optimal value of the objective function will increase by $27.

A Maximization Integer Linear Model Is Solved by First Relaxing