GCO 2802 Computer models for business decision
Assignment 1
Question 1
Denim Corduroy Total
Cotton(pounds) 5 7.5 6500
Hour 3.0 3.2 3000
Profit($ per yard) $2.25 $3.10
Demand(yards per month) ¡Þ 510
(a) Linear Programming Model:
Problem definition
Resource Availability: 6500 pounds of cotton
3000hours processing time
Decision Variables: X1 = number of yards of denim to produce per day
X2 = number of yards of corduroy to produce per day
Objective Function: Maximize Z= $2.25X1+ $3.10X2
Where Z = profit per day
Resource Constraints: 5X1+ 7.5X2¡Ü 6500
3X1+ 3.2X2¡Ü 3000
Non-Negativity: X1, X2¡Ý 0
Complete Linear programming model
Maximize Z= $2.25X1+ $3.10X2
Subject to: 5X1+ 7.5X2¡Ü 6500
3X1+ 3.2X2¡Ü 3200
X2¡Ü 510
X1, X2¡Ý 0
(b) Standard Form
Max Z= $2.25X1+ $3.10X2+ 0S1+ 0S2
Subject to: 5X1+ 7.5X2+ S1¡Ü......
Join Now or Login to view the rest of this paper.
Approximate Word Count: 2700
Approximate Pages: 11 (260 words per double-spaced page) |