Sunteți pe pagina 1din 6

1)

LP OPTIMUM FOUND AT STEP

OBJECTIVE VALUE = 23.7500000

NEW INTEGER SOLUTION OF

23.0000000

AT BRANCH

0 PIVOT

BOUND ON OPTIMUM: 23.00000


ENUMERATION COMPLETE. BRANCHES=

0 PIVOTS=

LAST INTEGER SOLUTION IS THE BEST FOUND


RE-INSTALLING BEST SOLUTION...

OBJECTIVE FUNCTION VALUE

1)

23.00000

VARIABLE

VALUE

REDUCED COST

X1

3.000000

-5.000000

X2

2.000000

-4.000000

ROW SLACK OR SURPLUS

DUAL PRICES

2)

0.000000

0.000000

3)

3.000000

0.000000

4)

3.000000

0.000000

5)

2.000000

0.000000

NO. ITERATIONS=
BRANCHES=

0 DETERM.= 1.000E

LP OPTIMUM FOUND AT STEP

OBJECTIVE VALUE = 7.31250000

FIX ALL VARS.(

1) WITH RC > 1.00000

NEW INTEGER SOLUTION OF

6.00000000

AT BRANCH

0 PIVOT

BOUND ON OPTIMUM: 6.000000


ENUMERATION COMPLETE. BRANCHES=

0 PIVOTS=

LAST INTEGER SOLUTION IS THE BEST FOUND


RE-INSTALLING BEST SOLUTION...

OBJECTIVE FUNCTION VALUE

1)

6.000000

VARIABLE

VALUE

REDUCED COST

X1

2.000000

-3.000000

X2

0.000000

-2.000000

ROW SLACK OR SURPLUS

DUAL PRICES

2)

5.000000

0.000000

3)

1.000000

0.000000

4)

2.000000

0.000000

5)

0.000000

0.000000

NO. ITERATIONS=
BRANCHES=

0 DETERM.= 1.000E

LP OPTIMUM FOUND AT STEP

OBJECTIVE VALUE = 38.3846169

NEW INTEGER SOLUTION OF

37.0000000

AT BRANCH

0 PIVOT

BOUND ON OPTIMUM: 37.00000


ENUMERATION COMPLETE. BRANCHES=

0 PIVOTS=

LAST INTEGER SOLUTION IS THE BEST FOUND


RE-INSTALLING BEST SOLUTION...

OBJECTIVE FUNCTION VALUE

1)

37.00000

VARIABLE

VALUE

REDUCED COST

X1

6.000000

-5.000000

X2

1.000000

-7.000000

ROW SLACK OR SURPLUS

DUAL PRICES

2)

0.000000

0.000000

3)

2.000000

0.000000

4)

6.000000

0.000000

5)

1.000000

0.000000

NO. ITERATIONS=
BRANCHES=

0 DETERM.= 1.000E

LP OPTIMUM FOUND AT STEP

OBJECTIVE VALUE = 41.2500000

SET

X1 TO <=

3 AT

1, BND= 39.00

NEW INTEGER SOLUTION OF

TWIN= 41.00

39.0000000

AT BRANCH

1 PIVOT

BOUND ON OPTIMUM: 41.00000


FLIP

X1 TO >=

4 AT

1 WITH BND=

SET

X2 TO <=

1 AT

2, BND= 40.56

TWIN=-0.1000E+31

SET

X1 TO >=

5 AT

3, BND= 40.00

TWIN= 37.00

NEW INTEGER SOLUTION OF

41.000000

40.0000000

15

AT BRANCH

3 PIVOT

BOUND ON OPTIMUM: 40.00000


DELETE

X1 AT LEVEL

DELETE

X2 AT LEVEL

DELETE

X1 AT LEVEL

ENUMERATION COMPLETE. BRANCHES=

3 PIVOTS=

LAST INTEGER SOLUTION IS THE BEST FOUND


RE-INSTALLING BEST SOLUTION...

OBJECTIVE FUNCTION VALUE


1)

40.00000

VARIABLE

VALUE

REDUCED COST

X1

5.000000

-8.000000

X2

0.000000

-5.000000

ROW SLACK OR SURPLUS

DUAL PRICES

2)

1.000000

0.000000

3)

0.000000

0.000000

4)

5.000000

0.000000

5)

0.000000

0.000000

NO. ITERATIONS=
BRANCHES=

15

3 DETERM.= 1.000E

12

15

15

LP OPTIMUM FOUND AT STEP

OBJECTIVE VALUE = 10.0000000

NEW INTEGER SOLUTION OF

10.0000000

AT BRANCH

0 PIVOT

BOUND ON OPTIMUM: 10.00000


ENUMERATION COMPLETE. BRANCHES=

0 PIVOTS=

LAST INTEGER SOLUTION IS THE BEST FOUND


RE-INSTALLING BEST SOLUTION...

OBJECTIVE FUNCTION VALUE

1)

10.00000

VARIABLE

VALUE

REDUCED COST

X1

0.000000

-1.000000

X2

2.000000

-5.000000

ROW SLACK OR SURPLUS

DUAL PRICES

2)

0.000000

0.000000

3)

0.000000

0.000000

4)

0.000000

0.000000

5)

0.000000

0.000000

NO. ITERATIONS=
BRANCHES=

0 DETERM.= 1.000E

LP OPTIMUM FOUND AT STEP

OBJECTIVE VALUE = 34.3529396

SET

X1 TO >=

1 AT

1, BND= 29.00

NEW INTEGER SOLUTION OF

TWIN=-0.1000E+31

29.0000019

AT BRANCH

1 PIVOT

BOUND ON OPTIMUM: 29.00000


DELETE

X1 AT LEVEL

ENUMERATION COMPLETE. BRANCHES=

1 PIVOTS=

LAST INTEGER SOLUTION IS THE BEST FOUND


RE-INSTALLING BEST SOLUTION...

OBJECTIVE FUNCTION VALUE

1)

29.00000

VARIABLE

VALUE

REDUCED COST

X1

1.000000

-4.000000

X2

5.000000

-5.000000

ROW SLACK OR SURPLUS

DUAL PRICES

2)

15.000000

0.000000

3)

5.000000

0.000000

4)

2.000000

0.000000

5)

5.000000

0.000000

6)

1.000000

0.000000

7)

3.000000

0.000000

NO. ITERATIONS=
BRANCHES=

11

1 DETERM.= 1.000E

11

11

11

S-ar putea să vă placă și