The Following Linear Programming Problem Has Been Written To Plan The Production Of Two Products The Company Wants To M 1 (37.11 KiB) Viewed 44 times
The following linear programming problem has been written to plan the production of two products. The company wants to maximize its profits. X₁ = Number of product 1 produced in each batch X₂ = Number of product 2 produced in each batch MAX: Subject to: 100X₁ + 300X₂ 2X₁ + 5X₂ ≤ 115 3X₁ + 7X₂ ≤ 135 X₁, X₂ ≥ 0 How much profit is earned per each unit of product 2 produced? O 100 115 O 135 300 O O
If the constraint 4X₁ + 5X₂ ≥ 800 is binding, then the constraint 8X₁ + 10X₂ ≥ 600 is which of the following? binding O limiting O redundant O infeasible
Solve the following LP problem graphically using level curves. (Round your answers to two decimal places.) 4X₁ + 5X₂ MAX: Subject to: 3X₁ +8X₂ ≤ 72 12X₁ + 11X₂ 132 2X₁ + 3X₂ ≤ 30 X₁, X₂ ≥ 0 (X₁, X₂) Obj = =
Solve the following LP problem using level curves. (If there is no solution, enter NO SOLUTION.) 4X₁ + 5X2 MAX: Subject to: 2X₁ + 3X2 < 102 4X₁ + 3X₂ ≤ 128 X₁ + X₂ > 75 X1, X₂ ≥ 0 What is the optimal solution? (X₁, X₂) = What is the optimal objective function value?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!