Scribd
Upload
102 views1 page

Chapter 2 Introduction To Optimization and Linear Programming Solutions To Supplementary Exercises

This document contains solutions to supplementary exercises for Chapter 2 on optimization and linear programming. The exercises provide examples of linear programming problems with optimal solutions identified for: 1) maximizing dog and cat food production given material constraints, 2) minimizing costs by determining optimal amounts of two agents given requirements, and 3) an example with alternate optimal solutions existing between corner points.

Uploaded by

w3n123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
102 views1 page

Chapter 2 Introduction To Optimization and Linear Programming Solutions To Supplementary Exercises

This document contains solutions to supplementary exercises for Chapter 2 on optimization and linear programming. The exercises provide examples of linear programming problems with optimal solutions identified for: 1) maximizing dog and cat food production given material constraints, 2) minimizing costs by determining optimal amounts of two agents given requirements, and 3) an example with alternate optimal solutions existing between corner points.

Uploaded by

w3n123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

ISOM3030 Quantitative Decision Analysis

Chapter 2 Introduction to Optimization and Linear Programming


Solutions to Supplementary Exercises

1. Corner points: (0, 0) , (0, 6) , (6.86, 3.43) , (9.43, 1.71) , (11, 0)


Optimal objective function value = 57.43; X1 = 9.43 and X2 = 1.71.

2. a. Let X1 = bags of Dog food to produce and X2 = bags of Cat food to produce
MAX: 4 X1 + 5 X2
Subject to: 4 X1 + 5 X2 ≤ 100 (meat)
6 X1 + 3 X2 ≤ 120 (soybeans)
4 X1 + 10 X2 ≤ 160 (filler)
X1 ≤ 40 (Dog food demand)
X2 ≤ 30 (Cat food demand)
X1, X2 ≥ 0
b. Optimal objective function value = 100; X1 = 10 and X2 = 12.

3. a. Let X1 = Pounds of agent A used a n d X2 = Pounds of agent B used


MIN: 5 X1 + 6 X2
Subject to: X1 ≥ 280 (Agent A requirement)
X2 ≥ 700 (Agent B requirement)
X1 + X2 = 1400 (Total pounds)
b. Optimal objective function value = 7700; X1 = 700 and X2 = 700.

4. Alternate optima solutions exist between the corner points: X1 = 9.6; X2 = 5.6 and X1 = 18; X2 =
0.

Page 1 of 1

You might also like