TOYCO
TOYCO
TOYCO
TOYCO assembles three types of toys: trains, trucks, and cars using three operations
the daily limits on the available times for the three operations are 430, 460, and 420
minutes, respectively, and the profit per toy train, truck, and car are $3, $2, and $5
respectively the assembly times per train at the three operations are 1, 3, and 1
minutes, respectively the corresponding times per truck and per car are
( 2 , 0 , 4 ) ∧(1 , 2 ,0) minutes.
(A zero times indicates that the operation is not used).
Letting x 1 , x 2 ,∧x 3represent the daily number of units assembles of trains, trucks,
and cars, the associated LP model is
TOYCO
Maximize Z=3 x1 +2 x 2+5 x 3
Subject to
x 1+ 2 x 2 + x 3 ≤ 430 ( operatoin 1 )
3 x 1++ 2 x 3 ≤ 460 ( operation 2 )
x 1+ 4 x 2 ≤ 420(operation 3)
x1 , x2 , x3 ≥ 0
Basic x1 x2 x3 s1 s2 s3 Solution
1 −1
x2 0
2 4
1
x3 0 0
2
s3 −2 1 1
c B =[3 2 5]
[ ]
−11
0
[ ] [ ]
430 42 1 2 1
−1
R= 460 A = 1 a i= 3 0 2
0 0
420 2 1 4 0
−2 1 1
−1
X B= A R
[][ ][ ][ ]
1 −1 1 −1
0 ( 430) (460) + 0(420)
x2 2 4 430 2 4 100
X B= x3 = 1 460 = +1 = 230
0 0 0( 430) (460) + 0(420)
s3 2 420 2 20
−2 1 1 −2(430) +1( 460) +1(420)
Z=C B X B
[ ]
100
Z=[ 2 5 0 ] 230 =2 ( 100 ) +5 ( 230 ) +0 ( 20 )=1350
20
Y =C B A−1
[ ]
1
−1
0
24
Y = [2 5 0 ] 1 =[ 1 2 0 ]
0 0
2
−2 1 1
Zi −Ci= yai−C i
[]
1
Z1 −C1= ya1−C 1=[ 1 2 0 ] 3 −3=4
1
[]
2
Z2 −C2= ya2−C 2=[ 1 2 0 ] 0 −2=0
4
[]
1
Z3 −C3 = ya3−C 3=[ 1 2 0 ] 2 −5=0
0
[ ][ ] [ ]
1−1 −1
0 1 0
2 4 1 2 1 4
−1
A ai = 1 3 0 2= 3
0 0 0 1
2 1 4 0 2
−2 1 1 2 0 0
Basic x1 x2 x3 s1 s2 s3 Solution
Z 4 0 0 1 2 0 1350
−1 1 −1
x2 1 0 0 100
4 2 4
3 1
x3 0 1 0 0 230
2 2
s3 2 0 0 −2 1 1 20
Sensitivity analysis
[ ]
44 0
R= 460
420
−1
X B= A R
[][ ][ ] [ ]
1 −1
0
x2 2 4 44 0 105
X B= x3 = 1 460 = 230
0 0
s3 2 420 0
−2 1 1
[][ ][ ] [ ][ ]
1
−1 1 −1
0 (602)
(644) + 0(588)
x2 24 602 2 4 1 40
X B= x3 = 1 644 = +1 = 322
0 0 0(602) (644) + 0(588)
s3 2 588 2 28
−2 1 1 −2( 602) +1(644) + 1(588)
[ ]
140
Z=C B X B =[ 2 5 0 ] 322 =$ 1890
28
Question 4
In TOYCO model. If the available of operation (2) is changed from 460 to 880.
Investigate the feasibility.
Solution
[ ]
44 0
R= 880
420
−1
X B= A R
[][ ][ ] [ ][ ]
1
−1 1 −1
0 (430)
(880) +0(420)
x2 24 44 0 2 4 −5
X B= x3 = 1 880 = +1 = 440
0 0 0(430) (880) +0(420)
s3 2 420 2 440
−2 1 1 −2(430) +1(880) +1(420)
[ ]
1
−1
0
24
Y = [3 4 0 ]
0
1
2
0
=
3
2 [ 5
4
0 ]
−2 1 1
The values of Zi −Ci for the non-basic variables x 1 , s1 , s 2 are completed from the
formula:
Zi −Ci= yai−C i
][ ]
1
Z1 −C1= [ 3
2
5
4
0 3 −[4 ]=
1
5
4
][ ]
1
Z2 −C2=
3
2 [ 5
4
0 0 −[0]=
0
3
2
][ ]
0
Z3 −C3 = [ 3
2
5
4
0 1 −[0]=
0
5
4
Since the problem is maximization and the values of Zi −Ci for the non-basic
variables x 1 , s1 , s 2 are non-negative, then the current solution
x 1=0 , x 2=100 ,∧x 3=230 Is still optimal.
[ ]
10 0
Z=[ 3 4 0 ] 230 =$ 1220
200
Question 10
Suppose now that the TOYCO objective function is changed to:
Max Z=3 x 1 +6 x 2+ x 3
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: