Maximize Z = 30x + 35y Subject to 10- 8 6 4 2x + 5y ≤ 2 4x + 4y < Xx νι νι ΛΙ ΛΙ Y a) Graph the feasible region for the

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

Maximize Z = 30x + 35y Subject to 10- 8 6 4 2x + 5y ≤ 2 4x + 4y < Xx νι νι ΛΙ ΛΙ Y a) Graph the feasible region for the

Post by answerhappygod »

 1
1 (38.88 KiB) Viewed 96 times
Maximize Z = 30x + 35y Subject to 10- 8 6 4 2x + 5y ≤ 2 4x + 4y < Xx νι νι ΛΙ ΛΙ Y a) Graph the feasible region for the two constraints. Drawing the feasible region requires 3 clicks for each constraint on the graph. Use the first two clicks to draw the line and the third click to select the region satisfying the constraint. 12- 30 36 > 0 0 >
Click once on each corner point of the feasible region to draw it. Then click on the first point again to close and shade it. 8 7 6 5 4 3 only the leasible region. (103) 2 1 2 Clear All Draw: Polygon 3 5 7 (c) State the optimal solution point and the objective function value. (30%)
(c) State the optimal solution point and the objective function value. (30%) Enter your answers below as fractions or decimals accurate to at least 4 decimal places. Do not use rounded values to calculate the objective function value. Use exact values. The optimal solution occurs at x = y = The optimal objective function value, Z = (d) At optimal solution, which constraints are non-binding? (10 %) Select all that apply. DC1 □C₂ OC3 CA
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply