2. Lab Week 2 Problem Solutions

2. Lab Week 2 Problem Solutions - Lab Week 2 Problem...

Info iconThis preview shows pages 1–5. 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

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: Lab Week 2 Problem Solutions CHAPTER 2 INTRODUCTION TO MANAGEMENT SCIENCE PROBLEMS 1. Defining a linear programming model: a. The main purpose of the model is to determine the quantities of tables, chairs, and bookcases to produce to maximize profit b. The decision variables here are quantity of tables, chairs, and bookcases c. The system constraints are labour hours, machine hours, and wood d. Each bookcase requires 2.5 hours of labour e. The company must produce at least 10 tables f. The amount of profit that will be realized from tables 3. Defining linear programming for a confectionary company a. the quantity of 3.5 ounce chocolate bars the quantity of 6 ounce chocolate bars b. constraints are: chocolate supply, minimum quantity to produce for both bars c. Maximize: Subject to Chocolate: 3.5 oz: 6 oz: Nonnegativity: 1 5. Linear Programming Model a. a. Four corners are (8,0), (0,6), (0,0), (4.7, 4.1) b. See above—the intersection is the optimal point. c. And d. e. 2 6. 12. Food Processing LP a. The optimal solution is to produce 15 boxes of x1 and 70 boxes of x2 for a total maximal profit of $27.00 b. yes, because it does not form a unique boundary of the feasible solution space. 3 13. Food Processing LP Analysis a. b.See above c. There would be multiple optimal solutions. 17. Health Store LP a. The optimal solution is: (1) Buy 105 units of product x1 and 25 units of product x2; (2) a total minimal cost of $289.50. b. Total cost is $289.50 4 21. LP Problem a. b. Because the LP states to maximize, the problem is unbounded. c. Either one of the constraints needs to be less-than or equal to, or the objective should be minimized. 5 ...
View Full Document

This note was uploaded on 12/04/2011 for the course ADM 2302 taught by Professor El during the Spring '05 term at University of Ottawa.

Page1 / 5

2. Lab Week 2 Problem Solutions - Lab Week 2 Problem...

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

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