Quiz 9 in Math 30210: Linear Programming Problem using Dual Simplex Method, Quizzes of Mathematics

Download Quiz 9 in Math 30210: Linear Programming Problem using Dual Simplex Method and more Quizzes Mathematics in PDF only on Docsity! Math 30210 — Introduction to Operations Research Quiz 9 – Wednesday November 14, 2007 NAME: Instructions: This is a closed-book quiz. Please do not use any notes. Consider the following linear programming problem: Minimize 4x1 + 2x2 + x3 subject to x1, x2, x3 ≥ 0 and x1 + x2 + x3 = 1 3x1 − 4x2 + x3 ≥ 2. 1. Set up an initial simplex tableau that would be suitable for solving the problem using the dual simplex method. (You may use the skeleton below). 2. Identify the initial basic solution, and say why it is an appropriate basic solution for the implementation of the dual simplex method. 3. Identify the departing basic variable in the first iteration of the dual simplex method. 4. Identify the entering basic variable in the first iteration of the dual simplex method. 1