Scribd
Upload
4 views

Assignment 1 - Opti2 - Slide

Uploaded by

hanforwork2203
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

Assignment 1 - Opti2 - Slide

Uploaded by

hanforwork2203
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Assignment 1 - Network Simplex

method and Upper Bound technique


for Minimum Cost Flow Problems
Subject: Optimization 2
Instructors: Prof. Nguyen Dinh
Group member: Nguyen Tuan Anh MAMAIU19003
Le Nguyen Dang Khoa MAMAIU19008
Diep Gia Hy MAMAIU19027
Nguyen Le Hong An MAMAIU19002
Bui To Mai MAMAIU17022
Table of content
1. Introduction
a. Minimum cost flow problems
b. Network simplex method
c. Incorporating the upper bound technique

1. Algorithm

2. Application
1. Introduction
a. Minimum cost flow problems
Given some notations The linear formulation of the problem

In words, the objective is to minimize the total cost of sending the


available supply through the network to satisfy the given demand.
1. Introduction
An example:
1. Introduction
b. Network simplex method.
Streamlined version of simplex method

Same steps:
- Finding the entering basic variables
- Determining the leaving basic variables.
- Solving for the basic feasible solution

Without using the simplex tableau.


1. Introduction
c. Incorporating upper bound technique

Used to deal with the arc capacity.

Usually comes with choosing a reversed arc.


2. Algorithm
2. Algorithm
2. Algorithm
2. Algorithm
3. Application
3. Application
Solve the initial basic feasible spanning tree:
3. Application
Solve the initial basic feasible spanning tree:
3. Application - Iteration 1:
3. Application - Iteration 1

The first tree is the new feasible tree


with the number on the arc is xij and
the second one is the updated network
with the reversed arc and the number
of the arc is the cost cij.
3. Application - Iteration 2

Here, in the cycle, there is no arc with


the upper limit, then we can just choose
as the minimum of the backward arc.
3. Application - Iteration 2
3. Application - Iteration 3
Since all of the reduced cost is
positive then the feasible tree at
step 4, iteration 2 is optimal. So
now we update the network
based on the optimal feasible
tree.
3. Application - Optimal solution
THANK YOU FOR LISTENING

You might also like