/*! 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}

91Ó°ÊÓ

For the linear program

max x1−2x3x1−x2≤12x2−x3≤1x1,x2,x3≥0

Prove that the solution(x1,x2,x3)=(3/2,1/2,0) is optimal

Short Answer

Expert verified

The solution (x1,x2,x3)=(3/2,1/2,0)is the optimal solution.

Step by step solution

01

Introduction to problem

Consider the three variables namelyx1,x2,x3and the two linear inequalities as follows,

x1−x2≤12x2−x3≤1

with a condition, x1,x2,x3≥0

Assume the inequalities be an equation of the form,

[1] x1−x2=1[2] 2x2−x3=1[3] x1,x2,x3=0

Equation’s last line signifies those variablesx1,x2,x3 can never be negative.

Consider the three cases:

Case (I): x1=0

Case (II):x2=0

Case (III):x3=0

02

Evaluate case  x1=0

In this case, Substitute x1=0in Equation [1],

[1] x1−x2=10−x2=1 â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰[∵x1=0]x2=−1

But no variable can be negative.

Hence, discard the Case (I)

03

Evaluate case  x2=0

In this case, substitutex2=0in Equation [1] as follows,

[1] x1−x2=1x1−0=1 â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰â¶Ä‰[∵x2=0]x1=1

Substitutex2=0in Equation [2] as follows,

[2]2x2−x3=10−x3=1 â¶Ä‰â¶Ä‰[∵x2=0]x3=−1

But no variable can be negative.

Hence, discard the Case (II).

04

Evaluate case  x2=0

In this case, substitutex3=0in Equation as follows,

[2]2x2−x3=12x2−0=1 â¶Ä‰â¶Ä‰â€‰[∵x3=0]2x2=1x2=12

Substitutex2=12in Equation [1] as follows,

[1]x1−x2=1x1−12=1​ â¶Ä‰â¶Ä‰â€‹â€‹â€‰[∵x2=12]x1=1+12x1=32

Therefore, this case is possible.

05

Finding  max x1−2x3

The maximum of x1−2x3 can be calculated as follows,

x1−2x3=32−2×0=32

Therefore, the optimal solution at(x1,x2,x3) is (3/2,1/2,0).

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 91Ó°ÊÓ!

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

Consider the following network (the numbers are edge capacities).

(a)Find the maximum flow fand a minimum cut.

(b)Draw the residual graphGf (along with its edge capacities). In this residual network, mark the vertices reachable fromS and the vertices from whichT 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 S⊂Vsuch that for each edge {U,V}∈E, 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.

maxx+y2x+y⩽3x+3y⩽5x,y⩾0

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 G=(V,E)with edge capacities {ce}. Instead of a single (s,t)pair, you are given multiple pairs (s1,t1),(s2,t2),…,(sk,tk), where the siare sources of Gand tithe are sinks of G. You are also given kdemands d1,…,dk. The goal is to find kflows f(1),…,f(k)with the following properties:

  • f(i)is a valid flow fromSi toti .
  • For each edge e, the total flowfe(1)+fe(2)+…+fe(k) does not exceed the capacityce .
  • The size of each flowf(i) is at least the demand di.
  • The size of the total flow (the sum of the flows) is as large as possible.

How would you solve this problem?

Consider the following linear program.

maximize 5x+3y

5x-2y≥0x+y≤7x≤5x≥0y≥0

Plot the feasible region and identify the optimal solution.

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.