Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Write the dual to the following linear program.

maxx+y2x+y3x+3y5x,y0

Find the optimal solutions to both primal and dual LPs

Short Answer

Expert verified

Dual LP:

Minimize3a+5b

Subject to

2a+b1a+3b1a,b0

Solution of primal LP, x=45,y=75 .

Solution of dual LP is a=25 ,b=15

Step by step solution

01

Explain Duality in Linear programming.

Every linear maximization problem has a dual minimization problem, and they relate to each other. Any feasible value of the dual LP is an upper bound on the original primal LP. For any feasible solution of the dual is an upper bound on any feasible solution of the primal.

02

Step 2:Derive the dual LP and the optimal solutions of primal, dual LP. 

Consider the given Linear programming,

maxx+y2x+y3x+3y5x,y0

To find the dual LP, minimize the maximum value with multipliers as follows,min3a+5b

Subject to

2a+b1a+3b1a,b0

Therefore, the above bound is the dual LP.

Consider the primal LP, and with the multipliers and Inequality,

For the value of X

2x+y3x+3y55x4

For the value of Y

2x+y3x+3y55y7

Therefore, the optimal solution of primal LP is x=45, y=75,

Consider the dual LP,

min3a+5b

2a+b1a+3b1a,b0

Compare, inequality as follows,

2a+b1a+3b12a+5b1a,b0

Therefore, the optimal solution of dual LP is a=25 , b=15.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Direct 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 G=(V1V2,E)be a bipartite graph (so each edge has one endpoint in V1and one endpoint in V2), and letMEbe a matching in the graph (that is, a set of edges that don’t touch). A vertex is said to be covered byMif it is the endpoint of one of the edges in M. An alternating path is a path of odd length that starts and ends with a non-covered vertex, and whose edges alternate between Mand E-M.

(a) In the bipartite graph below, a matching Mis shown in bold. Find an alternating path.


(b) Prove that a matchingMis 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 inO(|V|+|E|)time using a variant of breadth-first search.

(d) Give a directO(|V|-|E|)algorithm 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 n available actors; actori chargesSj dollars. For funding, there arem available investors. Investorj will providepj dollars, but only on the condition that certain actorsLj{1,2,...,n} are included in the cast (all of these actorsLj must be chosen in order to receive funding from investorrole="math" localid="1658404523817" j ).

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 {0,1}.

(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 sof boys is connected to at least |s|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.

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free