Lab Assignment 1 - IOE 310 Winter 2010 Lab Assignment #1...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
IOE 310 – Winter 2010 Lab Assignment #1 – Simplex Algorithm Due on: Thursday, February 4, 2010 by 9:00AM, submit on CTools Name: Lab Section: 1 Consider the following linear programming model: Maximize Z = 2 x 1 + 4 x 2 + 3 x 3 subject to 3 x 1 + 4 x 2 + 2 x 3 60 2 x 1 + x 2 + 2 x 3 ≤ 40 x 1 + 3 x 2 + 2 x 3 ≤ 80 and x 1 ≥ 0, x 2 ≥ 0, x 3 ≥ 0 Solve the above problem using the simplex method in tabular format by completing the below tables: Initial Tableau: Basic Vars Eq. Coefficient of: RHS ratio Z x 1 x 2 x 3 x 4 x 5 x 6 Z (0) 1 -2 -4 -3 0 0 0 0 x 4 (1) 0 3 4 2 1 0 0 60 15 x 5 (2) 0 2 1 2 0 1 0 40 40 x 6 (3) 0 1 3 2 0 0 1 80 80/3 Iteration 1. Basic Vars Eq. Coefficient of: RHS ratio Z x 1 x 2 x 3 x 4 x 5 x 6 Z (0) 1 1 0 -1 1 0 0 60 x 2 (1) 0 ¾ 1 ½
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
Ask a homework question - tutors are online