Use Graphical Methods to Solve the Linear Programming Problem

question 8

Multiple Choice

Use graphical methods to solve the linear programming problem.
-Minimize z = 4x + 5y subject to:
2x - 4y ≤ 10
2x + y ≥ 15
x ≥ 0
Y ≥ 0

• A)Minimum of 33 when x = 7 and y = 1
• B)Minimum of 39 when x = 1 and y = 7
• C)Minimum of 20 when x = 5 and y = 0
• D)Minimum of 75 when x = 0 and y = 15

Comprehend the effect of reserve prices on auction outcomes.

Grasp the concept of private and common values in auctions and their impact on bidding strategies.

Identify profit-maximizing strategies for both sellers and bidders in auctions.

Recognize the implications of bidder information and valuation differences on auction outcomes.