Consider the following linear programming model

Where, I ? c: ? 3, 4 ? c ₂ , ? 6, -1 ? a ₁₁ ? 3, 2 ? a ₁₂ ? 5, 8 ? b ₁ ? 12, 2 ? a ₂₁ ? 5, 4 ? a ₂₂ ? 6, 10 ? b ₂ ? 14.

Apply linear programming models to determine the lower bound and upper bounds of the optimal objective value. You should articulate how you can get the lower and upper bounds of the objective value.

Transcribed Image Text:

max 2 = c₁x₁ + C₂X₂ [a₁₁x₁ + ₁₂x₂ ≤b₂ s.t. α₂₁ +₂₂₂ ≤b₂ xy, X₂ 20 max 2 = c₁x₁ + C₂X₂ [a₁₁x₁ + ₁₂x₂ ≤b₂ s.t. α₂₁ +₂₂₂ ≤b₂ xy, X₂ 20

Answer rating: 100% (QA)

Consider constraints the graph a x i x 1 x 2 plan each point has the coordinates of type x ... View the full answer