Question

Given this graph of the feasible region, what is the maximum value of the function p = 3x + y
?
A detailed description of this image is available via the 'View Image Description' button.
View Image Description

34

11

41

9

Answer 1

I can solve it, but I need the feasible region details (the constraint lines or the coordinates of the corner points). Please either

- paste the "View Image Description" text, or
- list the inequalities (or the corner coordinates) that define the feasible region.

How I'll proceed once I have that:
1. Find the corner (vertex) coordinates of the feasible polygon (solve pairwise intersections of the boundary lines).
2. Compute p = 3x + y at each vertex.
3. The largest of those values is the maximum (a linear objective attains its max at a vertex of a convex polygon).

If you prefer, paste the image description and I will compute the maximum and tell you which choice (34, 11, 41, or 9) is correct.