Scribd
Upload
69 views7 pages

1.a) Solution

The document provides the solution to a linear programming problem with multiple parts: i) The optimal solution is given with basic variables of Z=300, x3=25, x2=25 and non-basic variables of x1, s1, s2. ii) It is shown that the current optimal basis remains the same if the profit of type 1 candy bars is ≤ $0.06 or if the profit of type 2 candy bars is between $0.05-0.15. iii) If the amount of available sugar is between 100/3-100 units, the current optimal basis still applies, such as when sugar is 60 units with an optimal profit of $3.40.

Uploaded by

Polu Vidya Sagar
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
69 views7 pages

1.a) Solution

The document provides the solution to a linear programming problem with multiple parts: i) The optimal solution is given with basic variables of Z=300, x3=25, x2=25 and non-basic variables of x1, s1, s2. ii) It is shown that the current optimal basis remains the same if the profit of type 1 candy bars is ≤ $0.06 or if the profit of type 2 candy bars is between $0.05-0.15. iii) If the amount of available sugar is between 100/3-100 units, the current optimal basis still applies, such as when sugar is 60 units with an optimal profit of $3.40.

Uploaded by

Polu Vidya Sagar
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/ 7

1.

a)
Solution:
Row0
0
1
2
3

CBV

0
1
0

Original Problem:
Z
1
0
0
0

x1
-3
2
1
1

x2
-2
1
1
0

x2

s3

x1

1
1
0

0
0
1

2
1
1

100
80
40

CBVB-1b

s1
0
1
0
0

=>
=>

s2
0
0
1
0

B-1

180

B-1 S2

2
1
-1

B-1 S1

-1
-1
1

rhs
0
100
80
40

-1
-1
1

CBV B-1

B-1 b

=>

s3
0
0
0
1

Ratio
50
80
40

2
1
-1
1

0
1
0
1

60
20
20

Given
BasicVariables(x2,s3,x1)
NBV(s1,s2)

-1
-1

1.00
1.00

1.00
1.00

1.00
1.00

-1

CBV B S1
CBV B-1 S1
CBV B S2
Row

x1

x2

s1
s2
First
First
element of Element of
-1

CBV B S1

Eros

s3

rhs

CBV B b

-1

B-1 b

rhs
180
60
20
20

-1

-1

CBV B S2

1
2
3

0
0
0

0
0
1

1
0
0

B S1

B S2

0
1
0

Row
0
1
2
3

Z
1
0
0
0

x1
0
0
0
1

x2
0
1
0
0

s1
1
-1
-1
1

s2
1
2
1
-1

s3
0
0
1
0

i)
ii)
iii)
iv)
v)

-1

Coefficient of each NBV in optimal table is s1=1,s2=1


Optimal Z value =180
Right hand side of each constrain in the optimal tableau is B-1b
=[60,20,20]
Columns of basic variables in optimal tableau is x2=[1 0 0],s3=[0 1
0],x1=[0 0 1]
Columns of non basic variables in optimal tableau is S1=[-1 -1
1],S2=[2 1 -1]

b)
Row 0
0
1
2
3

-0.5
-0.25
0.25

Original Problem:
Z
1
0
0
0

x1
-4
2
1
4

x2
-1
3
1
1

s1
0
1
0
0

s1

s2

x1

1
0
0

0
1
0

2
1
4

4
1
2

s2
0
0
1
0

=>

=>

s3
0
0
0
1

B-1

rhs
0
4
1
2

1
0
0

B-1 b

Given
Basic Variables(s1,s2,x1)
NBV(x2,s3)

0
1
0

-0.5
-0.25
0.25

3
0.5
0.5

CBV

-1

CBV B b

B-1 S3

-0.5
-0.25
0.25

B-1 X2

2.5
0.75
0.25
0.25

-1

CBV B S3
c2

1.00

1.00

1.00

-1

CBV B X2-c2

Eros

CBV B-1

=>

0.00

Row

x1

x2

s1

s2

CBV B X2-C

-1

s3
First
Element of
CBV B-1 S3

rhs
-1

CBV B b

1
2
3

0
0
0

0
0
1

B-1 X2

1
0
0

0
1
0

B-1 S3

B-1 b

Row
0
1
2
3

Z
1
0
0
0

x1
0
0
0
1

x2
0.00
2.5
0.75
0.25

s1
0
1
0
0

s2
0
0
1
0

s3
1
-0.5
-0.25
0.25

rhs
2
3
0.5
0.5

i)
ii)
iii)
iv)
v)

1[c]

Coefficient of each NBV in optimal table is X2=0,S3=1


Optimal Z value =2
Right hand side of each constrain in the optimal tableau is B-1b
=[3,0.5,0.5]
Columns of basic variables in optimal tableau is x1=[0 0 1],s1=[1 0
0],s2=[0 1 0]
Columns of non basic variables in optimal tableau is
X2=[2.5 0.75 0.25],S3=[-0.5,-0.25,0.25]

Solution:
Row 0
0
1
2

Original Problem:
Z
1
0
0

CBV

x1
-5
1
5

x2
-3
1
3

s1

x1

1
0

1
5

-1

B X3

s2
0
0
1

rhs
0
6
15

=>
CBV B-1

=>

6
15

B-1X2

s1
0
1
0

-1

x3
-1
3
6

Given
BasicVariables(s1,x1)
NBV(x2,x3,s2)

-0.2

0.2

B-1 b

=>

3
3

0.4
0.6

1.8
1.2
-1

B S2

-0.2
0.2

CBVB-1b

15

CBVB-1X2-c2

0.00

CBVB-1X3-c3

5.00
-1

CBV B S2

1.00

Row

x1

1.00

1.00

x2

x3

s1

-1

-1

CBV B X2-C CBV B X3-C

s2
First
Element of
-1

rhs
-1

CBV B b

CBV B S2
1
2

0
0

0
1

B-1 X2

B-1 X3

1
0

B-1 S2

B-1 b

Eros

Row
0
1
2

i)
ii)
iii)
iv)
v)

Z
1
0
0

x1
0
0
1

x2
0.00
0.4
0.6

x3
5.00
1.8
1.2

s1
0
1
0

s2
1.00
-0.2
0.2

rhs
15
3
3

Coefficient of each NBV in optimal table is X2=0,X3=5,S2=1


Optimal Z value =15
Right hand side of each constrain in the optimal tableau is B-1b
=[15,3,3]
Columns of basic variables in optimal tableau is x1=[0 1],s1=[1 0]
Columns of non basic variables in optimal tableau is
X2=[0.4 0.6],X3=[1.8 1.2], S2=[-0.2 0.2]

2. Solution:
Given:
Row 0
0
1
2

Original Problem:
Z
1
0
0

x1
-3
1
2

x2
-7
1
3

x3
-5
1
1

s1
0
1
0

s2
0
0
1

rhs
0
50
100

Given Baic Variables:


Z=300,(x3=25,x2=25)
NBV=(x1,s1,s2)

Row 0

Optimal Table:
Z

x1

x2

x3

s1

s2

rhs

Basicvariables:

0
1
2

1
0
0

3
0.5
0.50

0
0
1

0
1
0

4
1.5
-0.5

1
-0.5
0.5

300
25
25

Row

x1

x2

x3

CBV B X1-C

-1

B-1 X1

0
1

1
2

0
0

s1
s2
First
First
Element of Element of
-1

1
0

-1

CBV B S1

CBV B S2

B-1 S1

B-1 S2

Z=300,(x3=25,x2=25)
NBV=(x1,s1,s2)

rhs
-1

CBV B b
B-1 b

a) x1 is non-basic variable in the optimal table, so changing the coefficient of x 1 in the objective
function will only change the coefficient of x1 in the optimal row 0.
Let the new coefficient of x1 in the objective function be 3 + .
The new coefficient of x1 in the optimal row 0 will becBVB-1X1-(3 + ) = 3 - .
Thus if 3 - 0 or 3 the current basis remains optimal.
Thus if profit for a Type 1 Candy Bar is 6 cents the current basis remains optimal.

b) Let profit of candy


bar of type
2 is 7+
x3
x2
B

1
1

1
3

=>

B-1

1.5
-0.5

-0.5
0.5

Therefore CBVB-1= [ 5 7+ ]

3 /2 1/2
1 /2 1 /2 ] = [4-/2 1+ /2]

Therefore, Coefficient of X1 in row 0 of optimal table is cBVB-1X1-C= [4-/2 1+ /2]

[1 ] -3= 3+
2

/2
Coefficient of s1 in row 0 of optimal table is 4- /2
Coefficient of s2 in row 0 of optimal table is 1+ /2
All the above three coefficients should be greater than or equal to zero.
i)
3+ /2 >= 0 implies >= -6
ii)
4- /2 >= 0 implies <= 8
iii)
1+ /2>= 0 implies >= -2
Therefore, -2<= <=8
Thus if the profit for candy bar to remains between 5 (7-2) and 15 (7+8), optimal solution
remains same.
So, if the profit of candy bar 2 changes to 13 cents, current basis remains optimal.
c) Let the amount of sugar changes to 50+
B-1b becomes =[

25+3/2
3 /2 1/2
50+ ]
] [
= 25 /2 ]
1 /2 1 /2
100

For the current basis to remain optimal,


i)
25+3/2 >= 0 implies 50/3
ii)
25 /2 >= 0 implies 50
Therefore , current basis remain optimal if 100/3 <= Amount of sugar <= 100
d) From problem above it is observed that for the current basis to remain optimal considering amount of
sugar , it should lie in between [100/3 100]
Thus if the amount of sugar changes to 60, current basis remains optimal.
New Profit = CBVB-1b =[4 1] [

60 ]
= 340 cents = $3.40 dollars
100

Number of candy bars of each type when amount of sugar changes to 60 is given by:
B-1b =[

3 /2 1/2
]
1 /2 1 /2

[ 60 ] = [ 40 =[ x 3
100
20
x2

That is 40 number of type 3 candy bars, 20 number of type 2 candy bars,0 number of type 1 candy
bars.
However, if the amount of sugar values goes to 30, the current basis will no longer remain optimal as
the values does not lie in intervals of [100/3 100] and need to recomputed the problem to find
optimal solution.
e) If the type 1 candy bar uses only 0.5oz of sugar and 0.5oz of chocolate, then

CBVB-1X1-C=[ 4 1 ] [

1/2
-3= -0.5 <0
1/2

The current basis does not remain optimal with the above condition and recomputing the problem
will give new optimal solution where type 1 candy bars would be manufactured.
f) Given Type 4 candy requires 3 oz of sugar and 4 oz of chocolate.
Coefficient of type 4 candy in optimal row is CBVB-1X4-C = [4 1] [

3
-17= -1 <0
4

For the given condition, current basis doesnt remain optimal. Recomputing the problem will give
new optimal solution where type 4 candy would be manufactured.

You might also like