Duyurular & Dokümanlar

Ders Notu 18

Lecture 8.1
Ders Notu
23.04.2022
Lecture 7.3
Ders Notu
7.04.2022
Lecture 7.2
Ders Notu
31.03.2022

• Artificial Solution and Big M Method


Lecture 7.1
Ders Notu
31.03.2022

• Artificial Solution and Big M Method

 


Lecture 14
Ders Notu
3.06.2021


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


Lecture 7
Ders Notu
13.04.2021
Lecture 2
Ders Notu
26.03.2021

 LINEAR PROGRAMMING - Examples


Lecture 1
Ders Notu
4.03.2021

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


Lecture 13
Ders Notu
10.05.2020
Lecture 12
Ders Notu
10.05.2020

Determination of the initial basic feasible solution


Lecture 10
Ders Notu
21.04.2020

¢ Introduction to Sensitivity Analysis

¢ Graphical Sensitivity Analysis 

Lecture 11
Ders Notu
21.04.2020

Chapter 5: Transportation Model and Its Variants


Lecture 6
Ders Notu
12.04.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
Ders Notu
12.04.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
Ders Notu
12.04.2020

Includes row calculations in simplex models for the following methods

M method

Two phase

Special Cases


Lecture 5
Ders Notu
1.04.2020

You can find examples of M method in this document


Lecture 4
Ders Notu
24.03.2020

Example of standard maximization problem. 

M method 

Example of minimization problem. 


Lecture 3
Ders Notu
24.03.2020

Contains basic information about the simplex method