Question: Consider the maximum flow problem. a.[15 pts]Create an example instance of a maximum flow problem. Your instance should contain 9n7 nodes and 17m13 arcs. b.[10

Consider the maximum flow problem.

a.[15 pts]Create an example instance of a maximum flow problem. Your instance should contain 9n7 nodes and 17m13 arcs.

b.[10 pts]State the feasible set and the objective in words. Explain clearly whether this is a discrete optimization problem.

c.[10 pts]Form the node-arc incidence matrix for your instance.

d.[15 pts]Give a feasible(not necessarily optimal) solution to your instance. What is the objective value for this feasible solution?

e.[15 pts]Provide an upper bound to the optimal objective value of your instance (without solving it). Explain clearly your approach in finding an upper bound.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

Consider the maximum flow problem. a.[15 pts]Create an example instance of a maximum flow problem. Your instance should contain 9n7 nodes and 17m13 arcs. b.[10 pts]State the feasible set and the...

Consider the maximum flow problem. a. Create an example instance of a maximum flow problem. Your instance should contain 9n7 nodes and 17m13 arcs. b. State the feasible set and the objective in...

Consider the maximum flow problem.a.[15 pts]Create an example instance of a maximum flow problem. Your instance should contain9n7 nodes and 17m13 arcs.b.[10 pts]State the feasible set and the...

Problem 1. {9 points} The following figure gives an input to the maximum flow problem, with source node 1, and sink node 6. A feasible flow has been computed by the FordFulkerson algorithm. As usual,...

(5; 4) 2 4 (5; 5) (7; 5) 1 (1; 1) (2;0) 6 (1; 1) (10; 8) (8; 8) 3 5 (9:8) a) Consider the maximum flow problem from node 1 to node 6 on the network given above. On each arc we have two numbers in the...

Exercise 7.20 (Duality and the max-flow min-cut theorem) Consider the maximum flow problem. (a) Let pi be a price variable associated with the flow conservation constraint at node i. Let qij be a...

Consider the maximum flow problem network shown below, where the source is node A , the sink is node F , and arc capacities are numbers shown next to these directed arcs. Page 6 of 9 a ) Use the...

Consider the maximum flow problem shown below, where the source is node A , the sink is node F , and the arc capacities are the numbers shown next to these directed arcs. a ) ( 1 4 points ) Formulate...

There exists a view that the UK is too small an economy to benefit from competition in many industries, with firms failing to reach minimum efficient scale. What does this imply for competition...

A 2-m wide side rectangular gate is hinged at the bottom, as shown in Figure P2.64. It is attached to a 70-kN, 1-m-diameter cylindrical block by a cable. Determine the height H needed if the gate...

When the seller of goods retains a security interest in goods until they are paid for, the security interest that is created and attached to the goods is known as a ( n ) _ _ _ _ _ _ _ Multiple Choice

A project has an initial outlay of $2,628. The project will generate cash flows of $612 in Years 1-6. What is the Equivalent Annual Annuity (EAA) of this project? Assume an interest rate of 13%.