I'm marking answers as brainliest ----- One of the vertices for this linear programming problem is __________. ----- (1,2) (3.5,
0) (0,2.3) (0,0)
1 answer:
Answer:
(0,2.3) if only one choice expected.
(0,2.3) and (0,0) if "all that apply" expected, since (0,0) is also a vertex of the green region.
Step-by-step explanation:
From the attached diagram, the given answer optsions are shown in brown.
The red line shows the optimal combinations of the two variables, hence a maximization problem.
Out of the four answer options, two coincide with a vertice of the valid region (shown in green), namely (0,0) and (0, 2.3).
Out of the two indicated options which correspond to a vertex, the origin (0,0) is usually ignored for a maximization problem, which leaves us with (0,2.3) as the answer.
You might be interested in
