Scribd
Upload
9 views

Homework2

This homework assignment consists of two problems due on February 14, 2025. Problem 1 requires writing the dual of a given linear programming problem, while Problem 2 involves formulating and solving a max flow problem on a directed graph, including its dual and finding the maximum flow and minimum cut. Students can use software tools like MATLAB or Excel for solving the problems.

Uploaded by

Ping Li
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Homework2

This homework assignment consists of two problems due on February 14, 2025. Problem 1 requires writing the dual of a given linear programming problem, while Problem 2 involves formulating and solving a max flow problem on a directed graph, including its dual and finding the maximum flow and minimum cut. Students can use software tools like MATLAB or Excel for solving the problems.

Uploaded by

Ping Li
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

HOMEWORK 2

Due on 2025/02/14, Friday, 23:59pm

Problem 1 (30 points). Consider the following LP:

maximize x1 + 2x2 + 3x3


x1 ,x2 ,x3
2x1 − x2 + 3x3 = 2
x2 − x3 ≥ 0
x1 + 3x2 + 5x3 ≤ 6
3x1 + x2 + x3 ≤ 5
x1 , x2 , x3 ≥ 0

Please write down the dual of this problem. (No need for deriving the dual through the min-max perspective.)

Problem 2 (70 points). Consider the max flow problem on the directed graph below with the orange
node being the source node (node s) and the green node being the terminal node (node t). The number on
each arc denotes the capacity of the arc. Do the following based on the lecture slides.
(1) (25 points). Please formulate the max flow problem as a linear program and solve it. (You can solve
the problem with matlab cvx toolbox, or excel, and any other software, no codes needed.)
(2) (25 points). Formulate the dual of this problem and solve it. (Please follow the dual problem on the
lecture note. In order to get 0-1 solution for yi ’s in the slides, please add the constraint 0 ≤ yi ≤ 1
for each yi variable. You can solve the problem with matlab cvx toolbox, or excel, and any other software,
no codes needed. )
(3) (20 points). Find the corresponding maximum flow and minimum cut of the graph.

You might also like