Represent constraints with equations, inequalities, and systems; interpret viable and non-viable solutions in context.
Choose the best feasible option from candidate values
Problem
Maximize profit by comparing these feasible points and objective values: \((2,~5)\) has value \(29\), \((4,~3)\) has value \(31\), and \((6,~1)\) has value \(27\). Identify the point that meets the goal.
Big Picture
What this problem is really about
Because the candidates are already feasible, the remaining task is to apply the stated objective correctly. We’ll preserve each point’s pairing with its profit value, compare the objective values rather than the coordinates, and identify the greatest one. Returning from that maximum value to its paired point gives the plan that meets the goal.
Inside Gozunta
Turn the preview into practice.
More than a preview
Gozunta lets you study this problem—and more than 10,000 others.
Create targeted learning sessions, use hints, check your answer, read the walkthrough, watch the video, print the work, and track your progress.
