IEOR162_hw08

IEOR162_hw08 - IEOR 162 Fall 2011 Homework 08 Note If an LP...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: IEOR 162, Fall 2011 Homework 08 Note. If an LP has n variables and m constraints (excluding nonnegativity constraints), its dual LP MUST have n constraints (excluding nonnegativity constraints) and m variables. 1. (Modified from Problem 6.3.6; 20 points) Sugarco can manufacture three types of candy bar. Each candy bar consists totally of sugar and chocolate. Fifty oz of sugar and 100 oz of chocolate are available. The compositions of each type of candy bar and the profit earned from each candy bar are shown in the table below. Amount of Amount of Profit Bar Sugar (Ounces) Chocolate (Ounces) (Cents) 1 1 2 3 2 1 3 7 3 1 1 5 After defining x i to be the number of type- i candy bars manufactured, Sugarco should solve the following LP: max 3 x 1 + 7 x 2 + 5 x 3 s.t. x 1 + x 2 + x 3 ≤ 50 (Sugar constraint) 2 x 1 + 3 x 2 + x 3 ≤ 100 (Chocolate constraint) x i ≥ ∀ i = 1 ,..., 3 . After adding two slack variables, the optimal simplex tableau is shown below....
View Full Document

This note was uploaded on 02/25/2012 for the course IEOR 162 taught by Professor Zhang during the Fall '07 term at Berkeley.

Page1 / 2

IEOR162_hw08 - IEOR 162 Fall 2011 Homework 08 Note If an LP...

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