PERT-CPM CON EL PROGRAMA LINDO (Comprobar)

1. MIN X7-X1
SUBJECT TO
X2-X1>=4
X3-X1>=6
X4-X2>=4
X5-X3>=8
X6-X4>=4
X6-X5>=10
X7-X6>=4
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 28.00000

VARIABLE VALUE REDUCED COST

X7 28.000000 0.000000

X1 0.000000 0.000000

X2 4.000000 0.000000

X3 6.000000 0.000000

X4 20.000000 0.000000

X5 14.000000 0.000000

X6 24.000000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 0.000000 0.000000

3) 0.000000 -1.000000

4) 12.000000 0.000000

5) 0.000000 -1.000000

6) 0.000000 0.000000

7) 0.000000 -1.000000

8) 0.000000 -1.000000

NO. ITERATIONS= 0
2. MIN X17-X1
SUBJECT TO
X2-X1>=6
X3-X1>=3
X4-X2>=6
X5-X2>=2
X13-X3>=5
X13-X12>=3
X6-X4>=3
X8-X6>=4
X7-X5>=3
X9-X7>=3
X10-X8>=1
X10-X9>=5
X11-X10>=4
X14-X13>=3
X15-X11>=4
X16-X15>=2
X17-X14>=3
X17-X16>=2
END

LP OPTIMUM FOUND AT STEP 16

OBJECTIVE FUNCTION VALUE

1) 32.00000

VARIABLE VALUE REDUCED COST

X17 32.000000 0.000000

X1 0.000000 0.000000

X2 6.000000 0.000000

X3 21.000000 0.000000

X4 12.000000 0.000000

X5 8.000000 0.000000

X13 26.000000 0.000000

X12 23.000000 0.000000

X6 15.000000 0.000000

X8 19.000000 0.000000

X7 12.000000 0.000000

X9 15.000000 0.000000

X10 20.000000 0.000000

X11 24.000000 0.000000

X14 29.000000 0.000000

X15 28.000000 0.000000

X16 30.000000 0.000000

 ROW SLACK OR SURPLUS DUAL PRICES

2) 0.000000 -1.000000

3) 18.000000 0.000000

4) 0.000000 -1.000000

5) 0.000000 0.000000

6) 0.000000 0.000000

7) 0.000000 0.000000

8) 0.000000 -1.000000

9) 0.000000 -1.000000

10) 1.000000 0.000000

11) 0.000000 0.000000

12) 0.000000 -1.000000

13) 0.000000 0.000000

14) 0.000000 -1.000000

15) 0.000000 0.000000

16) 0.000000 -1.000000

17) 0.000000 -1.000000

18) 0.000000 0.000000

19) 0.000000 -1.000000

NO. ITERATIONS= 16
3. MIN X14-X1
SUBJECT TO
X2-X1>=2
X3-X2>=3
X4-X3>=3
X5-X3>=2
X6-X4>=2
X8-X3>=5
X7-X6>=2
X8-X6>=3
X11-X8>=8
X12-X11>=3
X13-X12>=2
X13-X10>=4
X10-X9>=4
X14-X13>=2
END

LP OPTIMUM FOUND AT STEP 13

OBJECTIVE FUNCTION VALUE

1) 28.00000

VARIABLE VALUE REDUCED COST

X14 28.000000 0.000000

X1 0.000000 0.000000

X2 2.000000 0.000000

X3 5.000000 0.000000

X4 8.000000 0.000000

X5 7.000000 0.000000

X6 10.000000 0.000000

X8 13.000000 0.000000

X7 12.000000 0.000000

X11 21.000000 0.000000

X12 24.000000 0.000000

X13 26.000000 0.000000

X10 22.000000 0.000000

X9 0.000000 0.000000
 ROW SLACK OR SURPLUS DUAL PRICES

2) 0.000000 -1.000000

3) 0.000000 -1.000000

4) 0.000000 -1.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 3.000000 0.000000

8) 0.000000 0.000000

9) 0.000000 -1.000000

10) 0.000000 -1.000000

11) 0.000000 -1.000000

12) 0.000000 -1.000000

13) 0.000000 0.000000

14) 18.000000 0.000000

15) 0.000000 -1.000000

NO. ITERATIONS= 13
4. MIN X9-X1
SUBJECT TO
X2-X1>=30
X3-X2>=10.33
X5-X2>=7.83
X4-X2>=9.67
X7-X3>=4
X8-X4>=10.83
X8-X2>=7.83
X8-X7>=1.33
X8-X6>=2.33
X9-X8>=15.17
END

LP OPTIMUM FOUND AT STEP 7

OBJECTIVE FUNCTION VALUE

1) 65.67000

VARIABLE VALUE REDUCED COST

X9 65.669998 0.000000

X1 0.000000 0.000000

X2 30.000000 0.000000

X3 45.169998 0.000000

X5 37.830002 0.000000

X4 39.669998 0.000000

X7 49.169998 0.000000

X8 50.500000 0.000000

X6 0.000000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 0.000000 -1.000000

3) 4.840000 0.000000

4) 0.000000 0.000000

5) 0.000000 -1.000000

6) 0.000000 0.000000

7) 0.000000 -1.000000

8) 12.670000 0.000000

9) 0.000000 0.000000

10) 48.169998 0.000000

11) 0.000000 -1.000000

NO. ITERATIONS= 7
5.

PRIMERA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=2
X3-X1>=3
X4-X2>=1.67
X4-X3>=3
X5-X3>=4.67
X6-X5>=4
X6-X4>=4
X8-X6>=3
X7-X5>=6
END

LP OPTIMUM FOUND AT STEP 7

OBJECTIVE FUNCTION VALUE

1) 14.67000

VARIABLE VALUE REDUCED COST

X8 14.670000 0.000000

X1 0.000000 0.000000

X2 4.330000 0.000000

X3 3.000000 0.000000

X4 6.000000 0.000000

X5 7.670000 0.000000

X6 11.670000 0.000000

X7 13.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 2.330000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 1.670000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 7
SEGUNDA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=1
X3-X1>=2
X4-X2>=0.67
X4-X3>=1
X5-X3>=2.67
X6-X5>=1
X6-X4>=2
X8-X6>=2
X7-X5>=2
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 7.670000

VARIABLE VALUE REDUCED COST

X8 7.670000 0.000000

X1 0.000000 0.000000

X2 2.330000 0.000000

X3 2.000000 0.000000

X4 3.000000 0.000000

X5 4.670000 0.000000

X6 5.670000 0.000000

X7 6.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 1.330000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 0.670000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 0
TERCERA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=2
X3-X1>=3
X4-X2>=1.67
X4-X3>=3
X5-X3>=4.67
X6-X5>=3
X6-X4>=4
X8-X6>=3
X7-X5>=6
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 13.67000

VARIABLE VALUE REDUCED COST

X8 13.670000 0.000000

X1 0.000000 0.000000

X2 4.330000 0.000000

X3 3.000000 0.000000

X4 6.000000 0.000000

X5 7.670000 0.000000

X6 10.670000 0.000000

X7 13.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 2.330000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 0.670000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 0
CUARTA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=2
X3-X1>=2
X4-X2>=1.67
X4-X3>=3
X5-X3>=4.67
X6-X5>=3
X6-X4>=4
X8-X6>=3
X7-X5>=6
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 12.67000

VARIABLE VALUE REDUCED COST

X8 12.670000 0.000000

X1 0.000000 0.000000

X2 3.330000 0.000000

X3 2.000000 0.000000

X4 5.000000 0.000000

X5 6.670000 0.000000

X6 9.670000 0.000000

X7 12.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 1.330000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 0.670000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 0
QUINTA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=2
X3-X1>=2
X4-X2>=1.67
X4-X3>=3
X5-X3>=3.67
X6-X5>=3
X6-X4>=3.67
X8-X6>=3
X7-X5>=6
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 11.67000

VARIABLE VALUE REDUCED COST

X8 11.670000 0.000000

X1 0.000000 0.000000

X2 3.330000 0.000000

X3 2.000000 0.000000

X4 5.000000 0.000000

X5 5.670000 0.000000

X6 8.670000 0.000000

X7 11.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 1.330000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 0.000000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 0
SEXTA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=2
X3-X1>=2
X4-X2>=1.67
X4-X3>=3
X5-X3>=2.67
X6-X5>=3
X6-X4>=2.67
X8-X6>=3
X7-X5>=6
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 10.67000

VARIABLE VALUE REDUCED COST

X8 10.670000 0.000000

X1 0.000000 0.000000

X2 3.330000 0.000000

X3 2.000000 0.000000

X4 5.000000 0.000000

X5 4.670000 0.000000

X6 7.670000 0.000000

X7 10.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 1.330000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 0.000000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 0
SEPTIMA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=2
X3-X1>=2
X4-X2>=1.67
X4-X3>=3
X5-X3>=2.67
X6-X5>=2.33
X6-X4>=2
X8-X6>=2.67
X7-X5>=5
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 9.670000

VARIABLE VALUE REDUCED COST

X8 9.670000 0.000000

X1 0.000000 0.000000

X2 3.330000 0.000000

X3 2.000000 0.000000

X4 5.000000 0.000000

X5 4.670000 0.000000

X6 7.000000 0.000000

X7 9.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 1.330000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 0.000000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 0
OCTAVA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=2
X3-X1>=2
X4-X2>=1.67
X4-X3>=2.67
X5-X3>=2.67
X6-X5>=2
X6-X4>=2
X8-X6>=2
X7-X5>=4
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 8.670000

VARIABLE VALUE REDUCED COST

X8 8.670000 0.000000

X1 0.000000 0.000000

X2 3.000000 0.000000

X3 2.000000 0.000000

X4 4.670000 0.000000

X5 4.670000 0.000000

X6 6.670000 0.000000

X7 8.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 1.000000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 0.000000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 0
NOVENA PROGRAMACIÓN

MIN X8-X1
SUBJECT TO
X2-X1>=2
X3-X1>=2
X4-X2>=1.67
X4-X3>=1.67
X5-X3>=2.67
X6-X5>=1
X6-X4>=2
X8-X6>=2
X7-X5>=3
END

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 7.670000

VARIABLE VALUE REDUCED COST

X8 7.670000 0.000000

X1 0.000000 0.000000

X2 2.000000 0.000000

X3 2.000000 0.000000

X4 3.670000 0.000000

X5 4.670000 0.000000

X6 5.670000 0.000000

X7 7.670000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 0.000000 0.000000

3) 0.000000 -1.000000

4) 0.000000 0.000000

5) 0.000000 0.000000

6) 0.000000 -1.000000

7) 0.000000 -1.000000

8) 0.000000 0.000000

9) 0.000000 -1.000000

10) 0.000000 0.000000

NO. ITERATIONS= 0