Scribd
Upload
2K views3 pages

Assignment 12 1 (PQT)

1. Smith's, a clothing manufacturer, produces shirts and pajamas. It has 280 hours of sewing machine time and 450 hours of cutting machine time available per month. Shirts require 1 hour of sewing and 1.5 hours of cutting, yielding $4 profit each. Pajamas require 0.75 hours of sewing and 2 hours of cutting, yielding $3 profit each. The linear programming model aims to maximize total profit by determining the optimal number of shirts and pajamas to produce. 2. The linear programming problem for Kevin Caskey Wholesale Inc. is to maximize profit of $9 per shirt and $7 per unit of product X2. The corner point method finds the optimal solution is

Uploaded by

jayann carranza
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
2K views3 pages

Assignment 12 1 (PQT)

1. Smith's, a clothing manufacturer, produces shirts and pajamas. It has 280 hours of sewing machine time and 450 hours of cutting machine time available per month. Shirts require 1 hour of sewing and 1.5 hours of cutting, yielding $4 profit each. Pajamas require 0.75 hours of sewing and 2 hours of cutting, yielding $3 profit each. The linear programming model aims to maximize total profit by determining the optimal number of shirts and pajamas to produce. 2. The linear programming problem for Kevin Caskey Wholesale Inc. is to maximize profit of $9 per shirt and $7 per unit of product X2. The corner point method finds the optimal solution is

Uploaded by

jayann carranza
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/ 3

Name: Carranza, Jay-Ann, L.

1. Smith’s, a clothing manufacturer in Niagara, New York that produces men’s shirts and pajamas, has
two (2) primary resources available: sewing-machine time (in the sewing department) and cutting- machine time
(in the cutting department). Over the next month, owner Barbara Smith can schedule up to 280 hours of work
on sewing machines and up to 450 hours of work on cutting machines. Each shirt produced requires 1.00 hour
of sewing time and 1.50 hours of cutting time. Producing each pair of pajamas requires 0.75 hours of sewing
time and 2 hours of cutting time. Smith’s accounting department analyzes cost and sales figures and states that
each shirt produced will yield a $4 contribution to profit and that each pair of pajamas will yield a $3 contribution
to profit.
Create a linear programming model for the Smith’s.

PRODUCTS
RESOURCE SHIRT PAJAMAS RESOURCE
(TYPE 1) (TYPE 2) AVAILABILITY
Sewing Machine 1 hr. 0.75 hrs. 280 hrs.
Cutting Machine 1.50 hrs. 2 hrs. 450 hrs.
Profit 4.00 3 hrs.

DECISION VARIABLES:

X 1 =be the number of shirts ¿ be produced∧sold

X 2 =be the number of pajamas ¿ be produced∧sold

CONSTRAINTS:

First Constraint: 1 X 1 +0 .7 5 X 2 ≤ 280 h ours of sewing mac h ine time available

Second Constraint:

1 .5 X 1+2 X 2 ≤ 450 h ours of cutting mac h ine timeavailable

Constraint for Non−Negativity : X 1 ≥ 0∧X 2 ≥ 0

Objective function:
The objective is to maximize the total profit. Hence,

Maximize Profit = Maximize Z = 4X1 + 3X2

Hence, The LP model is as follows,

Maximize Profit = Maximize Z = 4X1 + 3X2

Subject to,
1 X 1 +0 .75 X 2 ≤=280

1 .5 X 1+2 X 2 ≤=450

X 1 ≥ 0∧ X 2 ≥ 0

Above LP model can be solved by using graphical method as follows,

The value of the objective function at each of these extreme points is as follows:

Extreme Point Coordinates Lines through Objective function value


(X1, X2) Extreme Point Z=4 X 1+ 3 X 2
O (0,0) 3 X 1 ≥0 4 ( 0 ) +3 ( 0 )=0
4 X 2≥0
A (280, 0) 1 X 1+0 . 75 X 2≤ 280 4 ( 280 ) +3 ( 0 )=1120
4 X 2≥0
B (254.29, 34.29) 1 X 1+0 . 75 X 2≤ 280 4 ( 254 . 29 ) +3 ( 34 . 29 )=1120
2 1 .5 X 1+2 X 2≤ 450
C (0, 225) 2 1 .5 X 1+2 X 2≤ 450 4 ( 0 ) +3 ( 225 )=675
3 X 1 ≥0

The maximum value of the objective function Z = 1120 happens at two extreme points, but the number of shirts
and pajamas to be made and sold are integers. So, the best solution is the following:

X1 = Number of Shirts to be produced and sold

= 280 shirts

X2 = Number of Pajamas to be produced and sold

= 0 Pajamas and,

Maximum Profit = $1120

2. Solve the linear programming problem for Kevin Caskey Wholesale Inc. using the corner-point method.

Maximize: $9𝑥1 + $7𝑥2

𝐶𝑜𝑛𝑠𝑡𝑟𝑎i𝑛𝑡𝑠: 2𝑥1 + 𝑥2 ≤ 40

𝑥1 + 3𝑥2 ≤ 30
𝑥1, 𝑥2 ≥ 0

SOLUTION:

Corner point a :( x 1=0 , x 2=0)Profit=0

Corner point b :( x 1=0 , x 2=10) Profit=9 (0)+ 7(10)=$ 70

Corner point d :( x 1=20 , x 2=0) Profit=9(20)+7 (0)=$ 180

Corner point c : ¿

COMPUTATION FOR CORNER POINT C

2 x1 + x 2=40 To find X1:

−2 x1 −6 x2 =−60 2 x1 + x 2=40

−5 x 2=−20 2 x1 + 4=40

x 2=4 2 x1 =36

x 1=18

To sum it all up, the best solution is: (X=18, X=4). Profit will be $190

You might also like