Announcements & Documents

Lecture 8.1
Lecture Note
4/23/2022
Lecture 7.3
Lecture Note
4/7/2022
Lecture 7.1
Lecture Note
3/31/2022

• Artificial Solution and Big M Method

 


Lecture 7.2
Lecture Note
3/31/2022

• Artificial Solution and Big M Method


Lecture 14
Lecture Note
6/3/2021


Methods of finding initial solution for a transportation problem: NWM ; LC


Lecture 7
Lecture Note
4/13/2021
Lecture 2
Lecture Note
3/26/2021

 LINEAR PROGRAMMING - Examples


Lecture 1
Lecture Note
3/4/2021

You can access the lecture document that we will use in the first and second weeks here.


Lecture 12
Lecture Note
5/10/2020

Determination of the initial basic feasible solution


Lecture 13
Lecture Note
5/10/2020
Lecture 11
Lecture Note
4/21/2020

Chapter 5: Transportation Model and Its Variants


Lecture 10
Lecture Note
4/21/2020

¢ Introduction to Sensitivity Analysis

¢ Graphical Sensitivity Analysis 

Lecture 6
Lecture Note
4/12/2020

As the name suggests, the method solves the LP in two phases: Phase I attempts to find a starting basic feasible solution, and, if one is found, Phase II is invoked to solve the original problem.


Lecture 9
Lecture Note
4/12/2020

This document includes four special cases that arise in the use of the simplex method.

1. Degeneracy

2. Alternative optima

3. Unbounded solutions

4. Nonexisting (or infeasible) solutions


Lecture 8
Lecture Note
4/12/2020

Includes row calculations in simplex models for the following methods

M method

Two phase

Special Cases


Lecture 5
Lecture Note
4/1/2020

You can find examples of M method in this document


Lecture 4
Lecture Note
3/24/2020

Example of standard maximization problem. 

M method 

Example of minimization problem. 


Lecture 3
Lecture Note
3/24/2020

Contains basic information about the simplex method