Chapter 17: Iterative Improvement and Linear Programming D R . S . S R I D H A R

A S S O C I A T E P R O F ES S O R

D E P A R T M E N T O F I S T

A N N A U N I V E R S I T Y

objectives

Iterative Improvement

What is LPP?

Advantages and Limitations of LPP

Formulation of LPP

Formulation of LPP

Procedure for LPP

Sample Problem

Example

Example

Example

What is Graph Method?

What is a graph method?

Procedure for Graphical Method

Example

Example

Example

Example…

Point C

Final Solution

Exceptional Cases

Exceptional cases

Simplex Method

Informal Algorithm for Simplex Method

Contd..

Example

Contd..

Contd..

Contd..

Contd..

Final Solution

Non-Canonical Problems - Minimization

How to transform constraints

Contd..

Algorithm

Two-Phase Method

Principle of Duality

Example

Example

Max-flow algorithm

Assumptions

Transportation Graph

Assumptions

Informal algorithm

Example

Construct augment path 1-3-5

Path 1-2-3-5

Final flow graph

Solution

Min-cut Max-flow

Formal algorithm

Bipartite Graph

Flipping of Edges

Informal algorithm

Formal algoithm

Complexity analysis

Stable Marriage Problem

Informal algorithm

Formal algorithm

Complexity Analysis

Glossary

Glossary