Lee L. Lowery, Jr.

Just another CoE WordPress site

5.62

Posted on by 

  MOR/LP

Date: 11/15/10                                   Time: 14:47:01
                     C:\PROGRA~3\MOR\5-64.LP

                        MODEL DESCRIPTION
      ****************************************************

"Problem 5-64.LP"
"Run using GOMERY CUT"

MIN Z = 16A0 + 7A1 + 10A2 + 3A3 + 4B0 + 2B1 + 4C0 + 4C1 + 8C2 +2C3 + 2D0 + 3D1

ST
A0 + A1+ A3 + B0 + C1 + D0 >= 1 
A0 + A1 + B1 + C2 + D0 >= 1
A0 + A1 + A3 + B1 + C0 + C2 + D0 >= 1
A0 + A2 + B0 + C2 + D1 >= 1 
A0 + A2 + C1 + C3 >= 1
A0 + A2 + B0 + C3 + D1 >=1 
A0 + A2 + A3 + C2 >= 1
4B0 + 2B1 + 4C0 + 4C1 + 8C2 + 2C3 - 0.2*Z >=0 
4C0 + 4C1 + 8C2 + 2C3 <= 10
B0 + B1 <=1 
D0 + D1>=1

ALLINTEGER

      ****************************************************


Gomory Cut - Mixed Integer Linear Programming





                            ^^^ Optimal Solution ^^^



Integer solution has been obtained
Z               =     10.0000
A0              =      0.0000
A1              =      0.0000
A2              =      0.0000
A3              =      1.0000
B0              =      0.0000
B1              =      1.0000
C0              =      0.0000
C1              =      0.0000
C2              =     -0.0000
C3              =      1.0000
D0              =      0.0000
D1              =      1.0000
 Surpl3         =      1.0000
 Surpl6         =      1.0000
 Surpl8         =      4.0000
 Slack9         =      8.0000
Surpl11         =      0.0000


Compile time:     0.00 (Secs.)
Run time    :     0.00 (Secs.)