Chapter 7: Q12E (page 241)
For the linear program
Prove that the solution is optimal
Short Answer
The solution is the optimal solution.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 7: Q12E (page 241)
For the linear program
Prove that the solution is optimal
The solution is the optimal solution.
All the tools & learning materials you need for study success - in one app.
Get started for free
Consider the following network (the numbers are edge capacities).

(a)Find the maximum flow and a minimum cut.
(b)Draw the residual graph (along with its edge capacities). In this residual network, mark the vertices reachable from and the vertices from which is reachable.
(c)An edge of a network is called a bottleneck edge if increasing its capacity results in an increase in the maximum flow. List all bottleneck edges in the above network.
(d)Give a very simple example (containing at most four nodes) of a network which has no bottleneck edges.
(e)Give an efficient algorithm to identify all bottleneck edges in a network.
A vertex cover of an undirected graph G = (V,E) is a subset of the vertices which touches every edge—that is, a subset such that for each edge , one or both of u, v are in S. Show that the problem of finding the minimum vertex cover in a bipartite graph reduces to maximum flow. (Hint: Can you relate this problem to the minimum cut in an appropriate network?)
Write the dual to the following linear program.
Find the optimal solutions to both primal and dual LPs
Consider the following generalization of the maximum flow problem.
You are given a directed network with edge capacities . Instead of a single pair, you are given multiple pairs , where the are sources of and the are sinks of . You are also given demands . The goal is to find flows with the following properties:
How would you solve this problem?
Consider the following linear program.
maximize 5x+3y
Plot the feasible region and identify the optimal solution.
What do you think about this solution?
We value your feedback to improve our textbook solutions.