IE 333 • Tüm Sınavlar • Operations Research II - Deterministic Problems

Solving LP with 2 variables

Example 1

Example 2

Example 3

Alternative Optimal Solutions

Example 4

Standard Form of LP

Example 1

Basic Solutions - Basic Feasible Solutions

Example 2

What is Simplex Method?

Example 3

Example 4

Example 5

Example 6 (Minimization)

Example 7 (Minimization)

Example 8 (Reverse)

Infeasible LP

Alternative Optimal Solutions

Unbounded LP

Direction of Unboundedness

Degeneracy

Alternative Optimal Solutions Example 1

Alternative Optimal Solutions Example 2

What is duality anyway?

Example 1

Example 2

Example 3

Meaning of Dual Varibles and Complementary Slackness

Example 4

Example 5

Idea Behind Dual Simplex

Comparing Primal/Dual Simplex

Example 1

Exam Like Question 1

Example 2

Combining with Primal Simplex

Example 3

Example 4

Example 5

Exam Like Question 2

Matrices of LP

Example 1

Forming a Table with Given BV

Example 2

General Procedure

Optimal Basis v Optimal Solution

Changing Objective Function Coefficient of a NBV

Example 3

Changing Objective Function Coefficient of a BV

Example 4

Changing RHS of a Constraint

Example 5

Changing Column of a NBV

Example 6

Adding a New Variable

Example 7

Adding a New Constraint

Example 8

Graphical Solution 1

Graphical Solution 2

Graphical Solution 3

Graphical Solution 4

Graphical Solution 5

Simplex Method 1

Simplex Method 2

Simplex Method 3

Simplex Method 4

Simplex Method 5

Simplex Method 6

Simplex Method 7

Duality 1

Duality 2

Duality 3

Duality 4

Duality 5

Duality 6

Dual Simplex 1

Dual Simplex 2

Dual Simplex 3

Dual Simplex 4

Sensitivity Analysis 1

Sensitivity Analysis 2

Sensitivity Analysis 3

Sensitivity Analysis 4

Sensitivity Analysis 5

Sensitivity Analysis 6

Definition / LP Solution

Assumptions of the Problem

Least Cost Method

Least Cost Method Example 1

Least Cost Method Example 2

Northwest Corner Method

Northwest Corner Method Example 1

Northwest Corner Method Example 2

Vogel's Method

Vogel's Method Example 1

Transportation Simplex Method

Example 1

Example 2

Example 3

Definition / LP Solution

Assumptions of the Problem

Hungarian Method

Hungarian Method: Trouble in Paradise

Example 1

Example 2

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Djikstra's Algorithm Example 1

Djikstra's Algorithm Example 2

Shortest Path Problem Example 1

Shortest Path Problem Example 2

Shortest Path Problem Example 3

General Procedure

Initial BFS

Iterations

Example

Introduction

Example 1

Example 2

An Important Question

Knapsack Problem and Branch&Bound

Knapsack Problemi B&B Example

Method

Example 1

Example 2

A New Approach to Optimization Problems

Inventory Problems

Inventory Problems Example 1

Resource Allocation Problems

Resource Allocation Problems Example 1

What is NLP?

One Variable Unconstrained Optimization

Convexity in Detail

Multivariable Unconstrained Optimization

Convexity in Detail

KKT Conditions

Example

Transportation Simplex Method 1

Transportation Simplex Method 2

Hungarian Method 1

Hungarian Method 2

Hungarian Method 3

Hungarian Method 4

Djikstra's Algorithm 1

Djikstra's Algorithm 2

Network Simplex Method 1

Network Simplex Method 2

Branch and Bound 1

Branch and Bound 2

Branch and Bound 3

Branch and Bound 4

Branch and Bound 5

Cutting Plane 1

Cutting Plane 2

Dynamic Programming 1

Dynamic Programming 2

Dynamic Programming 3

Dynamic Programming 4

Dynamic Programming 5

Dynamic Programming 6

Dynamic Programming 7

Non-Linear Programming 1

Non-Linear Programming 2

Non-Linear Programming 3

Non-Linear Programming 4

Non-Linear Programming 5

Non-Linear Programming 6

Non-Linear Programming 7

Non-Linear Programming 8