UNIVERSIDAD NACIONAL DEL ALTIPLANO

FACULTAD DE INGENIERIA DE MINAS PUNO

NOMBRES Y APELLIDOS: Juan Manuel Laime Mamani

PROBLEMA N 1
RESOLVIENDO EN LINDO.
min 20000x1 +22000x2 + 18000x3
subject to
40x1 +60x2 +10x3 >= 540
40x1 +40x2 +60x3 >= 650
x1<=7
x2<=7
x3<=7
LP OPTIMUM FOUND AT STEP

OBJECTIVE FUNCTION VALUE

1)

279000.0

VARIABLE
VALUE
X1
1.750000
X2
7.000000
X3
5.000000
ROW
2)
3)
4)

REDUCED COST
0.000000
0.000000
0.000000

SLACK OR SURPLUS DUAL PRICES

0.000000
-240.000000
0.000000
-260.000000
5.250000
0.000000

CODIGO: 123583

5)
6)

0.000000
2.000000

NO. ITERATIONS=

2800.000000
0.000000
3

RANGES IN WHICH THE BASIS IS UNCHANGED:

OBJ COEFFICIENT RANGES
VARIABLE
CURRENT
ALLOWABLE
ALLOWABLE
COEF
INCREASE
DECREASE
X1 20000.000000 52000.000000 1750.000000
X2 22000.000000 2800.000000
INFINITY
X3 18000.000000 7000.000000 13000.000000
RIGHTHAND SIDE RANGES
ROW
CURRENT
ALLOWABLE
ALLOWABLE
RHS
INCREASE
DECREASE
2 540.000000
175.000000
58.333336
3 650.000000
100.000000
250.000000
4
7.000000
INFINITY
5.250000
5
7.000000
1.093750
3.281250
6
7.000000
INFINITY
2.000000

RESOLVIENDO EN SOLVE:
20
40
40
1
0
0

22
60
40
0
1
0

18
10
60
0
0
1

540
650
7
3.71875
3.6875

540
650
7
7
7
288.1875

RESOLVIENDO EN WINQSB

PROBLEMA N2
Resolviendo por LINDO
LP OPTIMUM FOUND AT STEP

OBJECTIVE FUNCTION VALUE

1)

2020.000

VARIABLE
VALUE
X11
0.000000
X12
0.000000

REDUCED COST
1.000000
1.000000

X13
X14
X15
X21
X22
X23
X24
X25
X31
X32
X33
X34
X35
Y1
Y2
Y3

ROW
2)
3)
4)
5)
6)
7)
8)
9)

0.000000
2.000000
75.000000
0.000000
0.000000
1.000000
75.000000
0.000000
50.000000
0.000000
0.000000
1.000000
0.000000
3.000000
0.000000
6.000000
0.000000
1.000000
0.000000
2.000000
35.000000
0.000000
0.000000
2.000000
35.000000
0.000000
0.000000 50000.000000
0.000000 30000.000000
0.000000 40000.000000

SLACK OR SURPLUS DUAL PRICES

0.000000
-7.000000
0.000000
-9.000000
0.000000
-10.000000
0.000000
-6.000000
0.000000
-7.000000
125.000000
0.000000
25.000000
0.000000
230.000000
0.000000

NO. ITERATIONS=

RANGES IN WHICH THE BASIS IS UNCHANGED:

OBJ COEFFICIENT RANGES
VARIABLE
CURRENT
ALLOWABLE
ALLOWABLE
COEF
INCREASE
DECREASE
X11
8.000000
INFINITY
1.000000
X12
10.000000
INFINITY
1.000000
X13
12.000000
INFINITY
2.000000
X14
6.000000
2.000000
6.000000
X15
8.000000
INFINITY
1.000000
X21
7.000000
1.000000
7.000000
X22
9.000000
1.000000
9.000000
X23
11.000000
INFINITY
1.000000
X24
9.000000
INFINITY
3.000000
X25
13.000000
INFINITY
6.000000
X31
8.000000
INFINITY
1.000000
X32
11.000000
INFINITY
2.000000
X33
10.000000
1.000000
10.000000
X34
8.000000
INFINITY
2.000000
X35
7.000000
1.000000
7.000000
Y1 50000.000000
INFINITY 50000.000000
Y2 30000.000000
INFINITY 30000.000000
Y3 40000.000000
INFINITY 40000.000000

ROW

RIGHTHAND SIDE RANGES

CURRENT
ALLOWABLE
ALLOWABLE
RHS
INCREASE
DECREASE

2
3
4
5
6
7
8
9

75.000000
50.000000
35.000000
75.000000
35.000000
200.000000
150.000000
300.000000

25.000000
75.000000
25.000000
50.000000
230.000000
35.000000
125.000000
75.000000
230.000000
35.000000
INFINITY
125.000000
INFINITY
25.000000
INFINITY
230.000000

Resolviendo por WINQSB

PROBLEMA N3
FUNC. OBJ.
SUBJECT TO

MIN 4X1 + X2
3X1 + X2 >= 10
X1 + X2 >= 5

X1 >= 3

Resuelto por WIN QSB