ps4 - Massachusetts Institute of Technology 16.410-13...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Massachusetts Institute of Technology 16.410-13 Principles of Autonomy and Decision Making Assignment #4 (written part) Due: Session 9 Objective To become comfortable framing problems as Linear Programming Problems, to practice converting problems into a form suitable for solution using the Simplex Method. These problems require that you read the background reading (see below). You are to solve the problems by hand (not using an LP solver). You are expected to write out the steps of your solutions. You may at your discretion use the algebraic or the tabular techniques described in the chapter. There is no programming part to this problem set. Background Solving Linear Programming Problems: The Simplex Method (handed out in class). This is Chapter 4 of “Introduction to Operations Research” by Frederick S. Hillier, Gerald J. Lieberman. Problem 1: Solve LP problem Consider the following problem: Maximize Z=x 1 + 2x 2 subject to x 1 + 3x 2 8 x 1 + x 2 4 x 1 0 x 2 0 Part a: Solve this problem graphically. Identify all corner-point feasible solutions.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/07/2011 for the course AERO 16.410 taught by Professor Brianwilliams during the Fall '05 term at MIT.

Page1 / 2

ps4 - Massachusetts Institute of Technology 16.410-13...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online