Chapter 7: Q1E (page 239)
Consider the following linear program.
maximize 5x+3y
Plot the feasible region and identify the optimal solution.
Short Answer
The maximum value is 31 at (5,2) is the optimal solution and the feasible region is plotted.
Chapter 7: Q1E (page 239)
Consider the following linear program.
maximize 5x+3y
Plot the feasible region and identify the optimal solution.
The maximum value is 31 at (5,2) is the optimal solution and the feasible region is plotted.
All the tools & learning materials you need for study success - in one app.
Get started for freeYou are given the following points in the plane:
.You want to find a line that approximately passes through these points (no line is a perfect fit). Write a linear program (you don’t need to solve it) to find the line that minimizes the maximum absolute error,
Moe is deciding how much Regular Duff beer and how much Duff Strong beer to order each week. Regular Duff costs Moe \(1 per pint and he sells it at \)2 per pint; Duff Strong costs Moe $1.50 per pint and he sells it at per pint. However, as part of a complicated marketing scam, the Duff company will only sell a pint of Duff Strong for each two pints or more of Regular Duff that Moe buys. Furthermore, due to past events that are better left untold, Duff will not sell Moe more than 3,000 pints per week. Moe knows that he can sell however much beer he has. Formulate a linear program for deciding how much Regular Duff and how much Duff Strong to buy, so as to maximize Moe’s profit. Solve the program geometrically.
For the following network, with edge capacities as shown, find the maximum flow from S to T, along with a matching cut.
An edge of a flow network is called critical if decreasing the capacity of this edge results in a decrease in the maximum flow. Give an efficient algorithm that finds a critical edge in a network
For the linear program
Prove that the solution is optimal
What do you think about this solution?
We value your feedback to improve our textbook solutions.