Question:medium

Solve the following linear programming problem graphically: Maximize \( Z = 8000x + 12000y \) subject to the boundary constraints: \( 3x + 4y \le 60 \), \( x + 3y \le 30 \), with non-negativity restrictions \( x \ge 0, y \ge 0 \).

Show Hint

When graphing lines quickly, always choose coordinates that generate integers for intercepts. If any point is fractional, scale your graph axis units carefully (e.g., choose steps of 5 or 10 units per grid square block) to minimize drawing alignment errors!
Show Solution

Solution and Explanation

Was this answer helpful?
0

Top Questions on Linear Programming