0% found this document useful (0 votes)
17 views8 pages

Alevelsb dm1 Ex7b

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views8 pages

Alevelsb dm1 Ex7b

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

The simplex algorithm 7B

1
b.v. x y z r s value θ values
r 1 2 0 1 0 6 3*
s 5 3 3 0 1 24 8
P −5 -6 −4 0 0 0

b.v. x y z r s value Row operations


1 1
y 2 1 0 2 0 3 R1÷ 2

s 7 0 3 −3 1 15 R2 − 3R1
2 2
P −2 0 −4 3 0 18 R3+ 6R1

b.v. x y z r s value Row operations

1 1
y 2 1 0 2 0 3 R1 (no change)
7 −1 1
z 6 0 1 2 3 5 R2 ÷ 3
8 4
P 3 0 0 1 3 38 R3+ 4R2

P = 38 x = 0 y = 3 z = 5 r=0 s=0

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 1
2
b.v. x y z r s value θ values
r 1 2 2 1 0 100 50
s 1 0 4 0 1 40 10*
P −3 −4 −10 0 0 0

b.v. x y z r s value Row operations

y 1 2 0 1 −1 80 R1− 2R2
2 2
z 1 0 1 0 1 10 R2 ÷ 4
4 4
−1 5
P
2
−4 0 0
2
100 R3+ 10R2

b.v. x y z r s value Row operations

y 1 1 0 1
−1 40 R1÷ 2
4 2 4
z 1 0 1 0 1 10 R2 (no change)
4 4
1 3 R3+ 4R1
P =P260 2x = 0 y0 = 40 0z = 102 r = 02 s = 260
0

P = 260 x = 0 y = 40 z = 10 r = 0 s=0

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 2
3
b.v. x y z r s t value θ values
r 3 4 5 1 0 0 10 2.5
s 1 3 10 0 1 0 5 12*
3
t 1 −2 0 0 0 1 1 negative pivot
P −3 −5 −2 0 0 0 0

b.v. x y z r s t value Row operations


5 − 25 −4 10
r
3
0
3
1
3
0
3
R1− 4R2

y 1 1 10 0 1 0 5 R2 ÷ 3
3 3 3 3
t 5 0 20 0 2 1 13 R3+ 2R2
3 3 3 3
P −4 0 44 0 5 0 25 R4 + 5R2
3 3 3 3

b.v. x y z r s t value Row operations


3 −4 R1 ÷ 5
x 1 0 −5 5 5 0 2 3
y 0 1 5 −1 3 0 1 R2 − 1 R1
5 5 3
t 0 0 15 −1 2 1 1 R3 − 5 R1
3
P 0 0 8 4 3 0 11 R4 − 4 R1
5 5 3

P = 11 x = 2 y =1 z=0 r=0 s=0 t =1

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 3
4
Basic x1 x2 x3 x4 s t u θ
r Value
variable values
r 1 4 3 1 1 0 0 0 95 95
1
s 2 1 2 3 0 1 0 0 67 33
2
t 1 3 2 2 0 0 1 0 75 75
u 3 2 1 2 0 0 0 1 72 24
P −4 3 −2 −3 0 0 0 0 0

Row
Basic x1 x2 x3 x4 s u
r t Value operations
variable
1 2 1 1 R1 − R4
r 0 3 2 1 0 0 − 71
3 3 3 3
1 4 2 2 R2 − 2R4
s 0 − 1 0 1 0 − 19
3 3 3 3
1 2 1 1 R3 − R4
t 0 2 1 1 0 0 1 − 51
3 3 3 3
2 1 2 1 R4 ÷ 3
x1 1 0 0 0 24
3 3 3 3
2 2 1 4 R5 + 4R4
P 0 5 − − 0 0 0 96
3 3 3 3

Basic x1 x2 x3 x4 s t u θ
r Value
variable values
1 2 1 1 5
r 0 3 2 1 0 0 − 71 26
3 3 3 3 8

1 4 2 2 1
s 0 − 1 0 1 0 − 19
3 3 3 3 14
4
1 2 1 1
t 0 2 1 1 0 0 1 − 51 3
3 3 3 3 30
5
2 1 2 1
x1 1 0 0 0 24 72
3 3 3 3
2 2 1 4
P 0 5 − − 0 0 0 96
3 3 3 3

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 4
4 continued
Basic x1 x2 x3 x4 s u Row
r t Value
variable operations
2
R1 −2
r 0 4 0 −3 1 −2 0 1 33 3
R2
1 1 3 1 1 3
x3 0 − 1 1 0 0 − 14 R2
4 4 4 2 4 4
3 3 1 1 1 2
t 0 2 0 − 0 −1 1 27 R3 −1 R2
4 4 4 2 4 3
3 1 1 1 1 1
x1 1 0 0 − 0 19 R4 − R2
4 4 4 2 4 3
1 1 1 1 1 2
P 0 5 0 0 0 105 R1 + R2
2 2 2 2 2 3
1 1 1 1
Maximum P = 105 , when x1 = 19 , x2 = 0, x3 = 14 , x4 = 0, r = 33, s = 0, t = 27 , u = 0
2 4 4 4

5 Let S = − P , so maximise S = −3x − 6 y + 32 z

Basic θ
x y z r s t u Value values
variable
r 1 6 24 1 0 0 0 672 28
s 3 1 24 0 1 0 0 336 14
1
t 1 3 16 0 0 1 0 168 10
2
u 2 3 32 0 0 0 1 352 11
P 3 6 −32 0 0 0 0 0

Basic x y z s u Row
r t Value
variable operations
1 1 1
r − 1 0 1 0 −1 0 420 R1 − 24R3
2 2 2
1 1 1
s 1 −3 0 0 1 −1 0 84 R2 − 24R3
2 2 2
1 3 1 1
z 1 0 0 0 10 R3 ÷ 16
16 16 16 2
u 0 −3 0 0 0 −2 1 16 R4+ 32R3
S 5 12 0 0 0 2 0 336

1
Minimum P = −336 ( S = 336 ), when x = 0, y = 0, z = 10 , r = 420, s = 84, t = 0, u = 16
2

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 5
6 Let S = − P , so maximise S = −2 x + 2 y − 3z

Basic x y z s t
θ
r Value
variable values
r 4 2 1 1 0 0 2 1
s 2 4 2 0 1 0 8 2
1
t 3 3 4 0 0 1 4 1
3
S 2 −2 3 0 0 0 0

Basic x y z s Row
r t Value
variable operations
y 1 1
2 1 0 0 1 R1 ÷ 2
2 2
s −6 0 0 −2 1 0 4 R2 − 4R1
1 1
t −3 0 2 −1 0 1 1 R3 − 1R1
2 2
S 6 0 4 1 0 0 2 R4 + 2R1

Minimum P = −2 ( S = 2 ), when x = 0, y = 1, z = 0, r = 0, s = 4, t = 1

7 For Q1
a
P = 5x + 6 y + 42 5(0) + 6(3) + 4(5) = 38
x + 2y + r = 6 0 + 2(3) + 0 = 6
5x + 3y + 32 + 5 = 24 5(0) + 3(3) + 3(5) + 0 = 24
b P + 8 x + r + 4 s = 38
3 3
1 x+ y+ 1r =3
2 2
7 x+z−1r+1s =5
6 2 3
8
c P = 38 − x − r − 4 s so increasing x, r or s would decrease P.
3 3

7 For Q2
a P = 3x + 4 y + 10z ⇒ 3(0) + 4(10) + 10(10) = 260
x + 2 y + 2z + r = 100 ⇒ 0 + 2(40) + 2(10) + 0 = 100
x + 4z + s = 40 ⇒ 0 + 4(10) + 0 = 40
b P + 1 x + 2r + 3 s = 260
2 2
1 x + y + 1 r − 1 s = 40
4 2 4
1 x + z + 1 s = 10
4 4
c P = 260 − 1 x − 2r − 3 s, so increasing x, r , or s would decrease P.
2 2

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 6
7 For Q3
a P = 3x + 5y + 2z ⇒ 3(2) + 5(1) + 2(0) = 11
3x + 4 y + 5z + r = 10 ⇒ 3(2) + 4(1) + 5(0) + 0 = 10
x + 3y + 10z + s = 5 ⇒ 2 + 3(1) + 10(0) + 0 = 5
x − 2 y + t = 1⇒ 2 − 2(1) + 1 = 1
b P + 8 z + 4 r + 3 s = 11
5 5
3
x − 5z + r − 4 s = 2
5 5
y + 5z − 1 r + 3 s = 1
5 5
15 z − r + 2s + t = 1
c P = 11 − 8 z − 4 r − 3 s, so increasing z, r or s would decrease P.
5 5

7 For Q4
11 1 1 211
b P + x2 + x4 + s + u =
2 2 2 2
4 x2 − 3x4 + r − 2s + u = 33
1 5 3 1 57
− x2 + x3 + x4 + s − u =
4 4 4 2 4
11 3 5 1 109
x2 − x4 − s + t + u =
4 4 4 2 4
3 1 1 1 77
x1 + x2 + x4 − s + u =
4 4 4 2 4
211 11 1 1
c P= − x2 − x4 − s − u , so increasing x2, x4, s or u would decrease P.
2 2 2 2

7 For Q5
b P − 5x − 12y − 2t = −336
1 3 3
− x + y + r − t = 420
2 2 2
3 7 3
x − y + s − t = 84
2 2 2
1 3 1 21
x+ y+z+ t =
16 16 16 2
c P = −366 + 5x + 12y + 2t, so increasing x, y or t would decrease P.

7 For Q6
b P − 6x − 4z − r = −2
1 1
2x + y + z + r = 1
2 2
−6x − 2r + s = 4
5 3
−3x + z − r + t = 1
2 2
c P = −2 + 6x + 4z + r, so increasing x, z or r would increase P.

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 7
8 a x, y are not basic variables, so x = 0, y = 0
3
first row: z =
2

b Reading off from the last row: P + 3x + 4 y + r = 3

9 a Reading off from the last row: P − x + 2 y − 2 z = 0

b
Basic θ
x y z r s t Value values
variable

4 1 2 1 0 0 2 1
r

s 1 2 1 0 1 0 8 8

4
t 2 4 3 0 0 1 4 3

P −1 2 −2 0 0 0 0

Row
Basic x y z s
r t Value operations
variable
1 1 R1 ÷ 2
z 2 1 0 0 1
2 2
1 1 R2 − R1
s −1 1 0 − 1 0 7
2 2
1 1 R3 − 3R1
t −4 2 0 −1 0 1 1
2 2
3 3 0 1 0 0 2 R2 + 2R1
P

c P = 2, x = 0, y = 0, z = 1, r = 0, s = 7, t = 1

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 8

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

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:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy