LINEAR PROGRAMMING PROBLEM

MAX 90t1+55t2+25r1+20r2+10n1+5n2
S.T.
1)
2)
3)
4)
5)
6)
7)
8)
9)
10)

-2t1-2t2+1r1+1r2>0
10000t1+10000t2>140000
1t1+1t2<20
3000r1+3000r2<99000
1000n1+1000n2>33000
4000t1+1500t2+2000r1+1200r2+1000n1+800n2>100000
10000t1+10000t2+3000r1+3000r2+1000n1+1000n2<279000
1t1<10
1r1<15
1n1<20

OPTIMAL SOLUTION
Objective Function Value =

2158.500

Variable
-------------t1
t2
r1
r2
n1
n2

Value
--------------10.000
4.700
15.000
18.000
20.000
13.000

Reduced Costs
-----------------0.000
0.000
0.000
0.000
0.000
0.000

Constraint
-------------1
2
3
4
5
6
7
8
9
10

Slack/Surplus
--------------3.600
7000.000
5.300
0.000
0.000
29050.000
0.000
0.000
0.000
0.000

Dual Prices
-----------------0.000
0.000
0.000
0.001
0.000
0.000
0.006
35.000
5.000
5.000

OBJECTIVE COEFFICIENT RANGES

Variable
-----------t1
t2
r1
r2
n1
n2

Lower Limit
--------------55.000
No Lower Limit
20.000
16.500
5.000
No Lower Limit

Current Value
Upper Limit
--------------- --------------90.000 No Upper Limit
55.000
66.667
25.000 No Upper Limit
20.000
25.000
10.000 No Upper Limit
5.000
5.500

RIGHT HAND SIDE RANGES

Constraint
-----------1
2
3
4
5
6
7
8
9
10

Lower Limit
--------------No Lower Limit
No Lower Limit
14.700
92250.000
20000.000
No Lower Limit
272000.000
0.000
0.000
0.000

Current Value
Upper Limit
--------------- --------------0.000
3.600
140000.000
147000.000
20.000 No Upper Limit
99000.000
106000.000
33000.000
40000.000
100000.000
129050.000
279000.000
297000.000
10.000
14.700
15.000
33.000
20.000
33.000