Practice question
Question
Consider the following Linear Programming Problem, Maximize Z = 7x + 3y, Subject to constraints x + 3y ≤ 5 x + y ≤ 4 x, y ≥ 0 Number of solutions for the LP will be
Explanation
From the definition, complete solution: write formula, plug data, do arithmetic. Final value matches Unique Solution. Simple and accurate.
Discussion
Comments
Please log in to join the discussion.
Login to commentNo comments yet. Be the first to start the discussion.