Chapter 8

Solution 20

LINEAR PROGRAMMING PROBLEM

MAX 0.07H+0.12P+0.09A

S.T.

1) 1H+1P+1A=1000000

2) 0.6H-0.4P-0.4A>0

3) 1P-0.6A<0

4) 1H>0

5) 1P>0

6) 1A>0

OPTIMAL SOLUTION

Objective Function Value = 88750.000

Variable Value Reduced Costs

-------------- --------------- ------------------

H 400000.000 0.000

P 225000.000 0.000

A 375000.000 0.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------

1 0.000 0.089

2 0.000 -0.031
 3 0.000 0.019

4 400000.000 0.000

5 225000.000 0.000

6 375000.000 0.000

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

H No Lower Limit 0.070 0.101

P 0.090 0.120 No Upper Limit

A 0.040 0.090 0.120

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

1 0.000 1000000.000 No Upper Limit

2 -400000.000 0.000 600000.000

3 -360000.000 0.000 600000.000

4 No Lower Limit 0.000 400000.000

5 No Lower Limit 0.000 225000.000

6 No Lower Limit 0.000 375000.000

Explanation:

Reduced cost is zero for all the three decision variables.

Dual price for constraint 1 is 0.089 which means that for every unit increase in constraint 1, the
optimum value will increase by 0.089.
Solution 21

LINEAR PROGRAMMING PROBLEM

MAX 30S1+20S2+35D1+30D2+1B2

S.T.

1) 1S1+1S2<130

2) 1D1+1D2<60

3) 1B2<50

4) 1S1+1D1<100

5) 1S2+1D2+1B2<120

OPTIMAL SOLUTION

Objective Function Value = 5430.000

Variable Value Reduced Costs

-------------- --------------- ------------------

S1 100.000 0.000

S2 30.000 0.000

D1 0.000 5.000

D2 60.000 0.000

B2 30.000 0.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------

1 0.000 19.000

2 0.000 29.000
 3 20.000 0.000

4 0.000 11.000

5 0.000 1.000

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

S1 25.000 30.000 No Upper Limit

S2 1.000 20.000 25.000

D1 No Lower Limit 35.000 40.000

D2 25.000 30.000 No Upper Limit

B2 0.000 1.000 20.000

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

1 110.000 130.000 160.000

2 40.000 60.000 90.000

3 30.000 50.000 No Upper Limit

4 70.000 100.000 120.000

5 90.000 120.000 140.000

Explanation:

Reduced cost of variable D1 is 5, which means that D1 has to increase by 5 units to appear in the
optimum solution.

The upper limit and lower limit values signify that when the variable coefficients and constraint values
are within that range, the solution is optimal.
Solution 29

LINEAR PROGRAMMING PROBLEM

MAX 1.5W+1R+2F

S.T.

1) 0.5W-0.5R-0.5F>0

2) -0.2W+0.8R-0.2F>0

3) -0.3W+0.7R-0.3F<0

4) -0.2W-0.2R+0.8F=0

5) 1W<10000

6) 1R<8000

OPTIMAL SOLUTION

Objective Function Value = 29000.000

Variable Value Reduced Costs

-------------- --------------- ------------------

W 10000.000 0.000

R 6000.000 0.000

F 4000.000 0.000

Constraint Slack/Surplus Dual Prices

 -------------- --------------- ------------------

1 0.000 0.000

2 2000.000 0.000

3 0.000 2.400

4 0.000 3.400

5 0.000 2.900

6 2000.000 0.000

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

W -1.400 1.500 No Upper Limit

R -0.500 1.000 No Upper Limit

F -4.000 2.000 No Upper Limit

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

1 No Lower Limit 0.000 0.000

2 No Lower Limit 0.000 2000.000

3 -1666.667 0.000 0.000

4 -2857.143 0.000 0.000

5 0.000 10000.000 13333.333

6 6000.000 8000.000 No Upper Limit

Chapter 9

Solution 10

LINEAR PROGRAMMING PROBLEM

MAX 0.1S+0.03B+0.04M+0.01C

S.T.

1) 1S+1B+1M+1C=1

2) 0.8S+0.2B+0.3M<0.18

3) 1S<0.75

4) -1B+1M>0

5) 1C>0.1

6) 1C<0.3

OPTIMAL SOLUTION

Objective Function Value = 0.028

Variable Value Reduced Costs

-------------- --------------- ------------------

S 0.009 0.000

B 0.345 0.000

M 0.345 0.000

C 0.300 0.000
 Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------

1 0.000 0.005

2 0.000 0.118

3 0.741 0.000

4 0.000 -0.001

5 0.200 0.000

6 0.000 0.005

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

S 0.090 0.100 No Upper Limit

B 0.028 0.030 0.036

M No Lower Limit 0.040 0.042

C 0.005 0.010 No Upper Limit

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

1 0.525 1.000 1.020

2 0.175 0.180 0.560

3 0.009 0.750 No Upper Limit

4 -0.633 0.000 0.100

5 No Lower Limit 0.100 0.300

6 0.280 0.300 0.775

Chapter 10

Solution 5

LINEAR PROGRAMMING PROBLEM

MAX 100A1+125B1+115C1+100D1+120A2+135B2+115C2+120D2+155A3+150B3+140C3+130D3

S.T.

1) 1A1+1B1+1C1+1D1<160

2) 1A2+1B2+1C2+1D2<160

3) 1A3+1B3+1C3+1D3<140

4) 1A1+1A2+1A3=180

5) 1B1+1B2+1B3=75

6) 1C1+1C2+1C3=100

7) 1D1+1D2+1D3=85

OPTIMAL SOLUTION

Objective Function Value = 57925.000

Variable Value Reduced Costs

-------------- --------------- ------------------

A1 0.000 10.000

B1 40.000 0.000

C1 100.000 0.000

D1 0.000 10.000
 A2 40.000 0.000

B2 35.000 0.000

C2 0.000 10.000

D2 85.000 0.000

A3 140.000 0.000

B3 0.000 20.000

C3 0.000 20.000

D3 0.000 25.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------

1 20.000 0.000

2 0.000 10.000

3 0.000 45.000

4 0.000 110.000

5 0.000 125.000

6 0.000 115.000

7 0.000 110.000

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

A1 No Lower Limit 100.000 110.000

B1 115.000 125.000 135.000

C1 105.000 115.000 No Upper Limit

D1 No Lower Limit 100.000 110.000

A2 110.000 120.000 140.000

B2 125.000 135.000 145.000

 C2 No Lower Limit 115.000 125.000

D2 110.000 120.000 No Upper Limit

A3 135.000 155.000 No Upper Limit

B3 No Lower Limit 150.000 170.000

C3 No Lower Limit 140.000 160.000

D3 No Lower Limit 130.000 155.000

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

1 140.000 160.000 No Upper Limit

2 140.000 160.000 200.000

3 120.000 140.000 180.000

4 140.000 180.000 200.000

5 35.000 75.000 95.000

6 0.000 100.000 120.000

7 45.000 85.000 105.000

Solution 6

LINEAR PROGRAMMING PROBLEM

MAX 32A1+34A2+32A3+40A4+34B1+30B2+28B3+38B4

S.T.

1) 1A1+1A2+1A3+1A4<5000

2) 1B1+1B2+1B3+1B4<3000

3) 1C1+1C2+1C3+1C4<4000

4) 1A1+1B1+1C1=2000

5) 1A2+1B2+1C2=5000

6) 1A3+1B3+1C3=3000

7) 1A4+1B4+1C4=2000

OPTIMAL SOLUTION

Objective Function Value = 282000.000

Variable Value Reduced Costs

-------------- --------------- ------------------

A1 0.000 4.000

A2 4000.000 0.000

A3 0.000 2.000

A4 1000.000 0.000

B1 2000.000 0.000
 B2 0.000 2.000

B3 0.000 4.000

B4 1000.000 0.000

C1 0.000 2.000

C2 1000.000 0.000

C3 3000.000 0.000

C4 0.000 6.000

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------

1 0.000 34.000

2 0.000 32.000

3 0.000 0.000

4 0.000 2.000

5 0.000 0.000

6 0.000 0.000

7 0.000 6.000

OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

A1 No Lower Limit 32.000 36.000

A2 32.000 34.000 36.000

A3 No Lower Limit 32.000 34.000

A4 38.000 40.000 42.000

B1 32.000 34.000 No Upper Limit

B2 No Lower Limit 30.000 32.000

B3 No Lower Limit 28.000 32.000

 B4 36.000 38.000 40.000

C1 No Lower Limit 0.000 2.000

C2 -2.000 0.000 2.000

C3 -2.000 0.000 No Upper Limit

C4 No Lower Limit 0.000 6.000

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

1 5000.000 5000.000 6000.000

2 3000.000 3000.000 4000.000

3 4000.000 4000.000 No Upper Limit

4 1000.000 2000.000 2000.000

5 4000.000 5000.000 5000.000

6 0.000 3000.000 3000.000

7 1000.000 2000.000 2000.000

Solution 8

LINEAR PROGRAMMING PROBLEM

MIN 1A1+1.2B1+0.9C1+1.3A2+1.4B2+1.2C2+1.1A3+1B3+1.2C3

S.T.

1) 1A1+1A2+1A3=2000

2) 1B1+1B2+1B3=500

3) 1C1+1C2+1C3=1200

4) 1A1+1B1+1C1<1500

5) 1A2+1B2+1C2<1500

6) 1A3+1B3+1C3<1000

OPTIMAL SOLUTION

Objective Function Value = 3990.000

Variable Value Reduced Costs

-------------- --------------- ------------------

A1 1500.000 0.000

B1 0.000 0.300

C1 0.000 0.000

A2 0.000 0.000

B2 0.000 0.200

C2 1200.000 0.000
 A3 500.000 0.000

B3 500.000 0.000

C3 0.000 0.200

Constraint Slack/Surplus Dual Prices

-------------- --------------- ------------------

1 0.000 -1.300

2 0.000 -1.200

3 0.000 -1.200

4 0.000 0.300

5 300.000 0.000

6 0.000 0.200
OBJECTIVE COEFFICIENT RANGES

Variable Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

A1 0.800 1.000 1.000

B1 0.900 1.200 No Upper Limit

C1 0.900 0.900 1.100

A2 1.300 1.300 No Upper Limit

B2 1.200 1.400 No Upper Limit

C2 1.000 1.200 1.200

A3 0.900 1.100 1.300

B3 No Lower Limit 1.000 1.200

C3 1.000 1.200 No Upper Limit

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

------------ --------------- --------------- ---------------

1 800.000 2000.000 2000.000

2 0.000 500.000 500.000

3 0.000 1200.000 1500.000

4 1500.000 1500.000 2700.000

5 1200.000 1500.000 No Upper Limit

6 1000.000 1000.000 2200.000