Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 Optimization Simplex Method (Exercise). 2 Problem How many kilogram of each product to produce in order to maximize weekly profit? Product 1Product.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "1 Optimization Simplex Method (Exercise). 2 Problem How many kilogram of each product to produce in order to maximize weekly profit? Product 1Product."— Presentation transcript:

1 1 Optimization Simplex Method (Exercise)

2 2 Problem How many kilogram of each product to produce in order to maximize weekly profit? Product 1Product 2Product 3Resource Availability Raw chemical 5 kg/kg4 kg/kg10 kg/kg3000 kg Production time 0.05 hr/kg0.1 hr/kg0.2 hr/kg55 hr/week $30/kg $35/kg

3 3 BasicZx1x1 x2x2 x3x3 S1S1 S2S2 RHSMRT Znever BasicZx1x1 x2x2 x3x3 S1S1 S2S2 RHSMRT Znever

4 4 BasicZx1x1 x2x2 x3x3 S1S1 S2S2 RHSMRT Znever BasicZx1x1 x2x2 x3x3 S1S1 S2S2 RHSMRT Znever

5 5 Problem #2a Which variables (besides Z ) are the basic variables? What are the values of x 1, x 2, x 3 ? Is this corner point solution optimal? BasicZx1x1 x2x2 x3x3 s1s1 s2s2 s3s3 RHS 100-1030030 00.5100.25002.5 0-0.504-0.251010 0301-0.50130

6 6 Problem #2b Which variable should be the entering variable and which variable should be the leaving variable? At the next corner point solution, what are the values of x 1, x 2, x 3 ? BasicZx1x1 x2x2 x3x3 s1s1 s2s2 s3s3 RHS 100-1030030 00.5100.25002.5 0-0.504-0.251010 0301-0.50130

Download ppt "1 Optimization Simplex Method (Exercise). 2 Problem How many kilogram of each product to produce in order to maximize weekly profit? Product 1Product."

Similar presentations

1. Set up the phase 1 dictionary for this problem and make the first pivot: Maximize X 1 + X 2 + 2 X 3 + X 4 subject to -X 1 + X 3 + 2 X 4 ≤ -3 -X 1 +

1. Set up the phase 1 dictionary for this problem and make the first pivot: Maximize X 1 + X X 3 + X 4 subject to -X 1 + X X 4 ≤ -3 -X 1 +
What happens to Klee-Minty examples if maximum increase rule is used?

What happens to Klee-Minty examples if maximum increase rule is used?
Linear Programming – Simplex Method

Linear Programming – Simplex Method
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)

Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 9-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ 07458 Chapter 9 Linear.

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 9-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 9 Linear.
Linear Programming Introduction George B Dantzig developed LP in 1947. It is a problem solving approach designed to help managers/decision makers in planning.

Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.
Step 1: Formulate the Problem Decision Variables Objective Function (O. F.) Constraints (S. T.) Sign Constraints (URS) Step 2: Create the Standard Form.

Step 1: Formulate the Problem Decision Variables Objective Function (O. F.) Constraints (S. T.) Sign Constraints (URS) Step 2: Create the Standard Form.
Operation Research Chapter 3 Simplex Method.

Operation Research Chapter 3 Simplex Method.
LINEAR PROGRAMMINGExample 1 MaximiseI = x + 0.8y subject tox + y  1000 2x + y  1500 3x + 2y  2400 Initial solution: I = 0 at (0, 0)

LINEAR PROGRAMMINGExample 1 MaximiseI = x + 0.8y subject tox + y  x + y  x + 2y  2400 Initial solution: I = 0 at (0, 0)
INFM 718A / LBSC 705 Information For Decision Making Lecture 4.

INFM 718A / LBSC 705 Information For Decision Making Lecture 4.
Exercise3.1 6. Exercise3.1 8 Exercise3.1 9 Exercise3.1 10.

Exercise Exercise3.1 8 Exercise3.1 9 Exercise
Exercise 1.1 4. Exercise 1.1 8 Exercise 1.2 6 Exercise 1.2 7.

Exercise Exercise Exercise Exercise
Optimization Mechanics of the Simplex Method

Optimization Mechanics of the Simplex Method
Exercise4.1 10. Exercise4.1 15 Exercise4.1 19 Exercise4.1 23.

Exercise Exercise Exercise Exercise
Exercise6.1 5. Exercise6.1 7 Exercise6.1 8 Exercise6.1 9.

Exercise Exercise6.1 7 Exercise6.1 8 Exercise6.1 9.
Optimization Linear Programming and Simplex Method

Optimization Linear Programming and Simplex Method
1 Optimization Simplex Method (Exercise). 2 Problem How many kilogram of each product to produce in order to maximize weekly profit? Product 1Product.

1 Optimization Simplex Method (Exercise). 2 Problem How many kilogram of each product to produce in order to maximize weekly profit? Product 1Product.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.

QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
MIT and James Orlin © 2003 1 Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.

MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.

Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.

Similar presentations

Ads by Google