Chapter 7: Q11E (page 240)
Write the dual to the following linear program.
Find the optimal solutions to both primal and dual LPs
Short Answer
Dual LP:
Subject to
Solution of primal LP, , .
Solution of dual LP is ,
Chapter 7: Q11E (page 240)
Write the dual to the following linear program.
Find the optimal solutions to both primal and dual LPs
Dual LP:
Subject to
Solution of primal LP, , .
Solution of dual LP is ,
All the tools & learning materials you need for study success - in one app.
Get started for freeDirect bipartite matching. We’ve seen how to find a maximum matching in a bipartite graph via reduction to the maximum flow problem. We now develop a direct algorithm.
Let be a bipartite graph (so each edge has one endpoint in and one endpoint in ), and letbe a matching in the graph (that is, a set of edges that don’t touch). A vertex is said to be covered byif it is the endpoint of one of the edges in . An alternating path is a path of odd length that starts and ends with a non-covered vertex, and whose edges alternate between and .
(a) In the bipartite graph below, a matching is shown in bold. Find an alternating path.
(b) Prove that a matchingis maximal if and only if there does not exist an alternating path with respect to it.
(c) Design an algorithm that finds an alternating path intime using a variant of breadth-first search.
(d) Give a directalgorithm for finding a maximal matching in a bipartite graph.
The pizza business in Little Town is split between two rivals, Tony and Joey. They are each investigating strategies to steal business away from the other. Joey is considering either lowering prices or cutting bigger slices. Tony is looking into starting up a line of gourmet pizzas, or offering outdoor seating, or giving free sodas at lunchtime. The effects of these various strategies are summarized in the following payoff matrix (entries are dozens of pizzas, Joey’s gain and Tony’s loss).
TONY | ||||
Gourmet | Seating | Freesoda | ||
JOEY | Lower price | +2 | 0 | -3 |
BiggerSlices | _1 | -2 | +1 |
For instance, if Joey reduces prices and Tony goes with the gourmet option, then Tony will lose 2 dozen pizzas worth of nosiness to Joey.
What is the value of this game, and what are the optimal strategies for Tony and Joey?
Hollywood. A film producer is seeking actors and investors for his new movie. There are available actors; actor charges dollars. For funding, there are available investors. Investor will provide dollars, but only on the condition that certain actors are included in the cast (all of these actors must be chosen in order to receive funding from investorrole="math" localid="1658404523817" ).
The producer’s profit is the sum of the payments from investors minus the payments to actors. The goal is to maximize this profit.
(a) Express this problem as an integer linear program in which the variables take on values .
(b) Now relax this to a linear program, and show that there must in fact be an integral optimal solution (as is the case, for example, with maximum flow and bipartite matching).
Hall’s theorem. Returning to the matchmaking scenario of Section 7.3, suppose we have a bipartite graph with boys on the left and an equal number of girls on the right. Hall’s theorem says that there is a perfect matching if and only if the following condition holds: any subset of boys is connected to at least girls.
Prove this theorem. (Hint: The max-flow min-cut theorem should be helpful.)
For the following network, with edge capacities as shown, find the maximum flow from S to T, along with a matching cut.
What do you think about this solution?
We value your feedback to improve our textbook solutions.