WIDTH 80
MODEL:  LongestPath - Dual

DATA:
ENDDATA

  [OBJ] G = -w1 + w6;

! Constraints;

! Directly translated from PRIMAL problem;
 	-w1 + w2 >= 4;
 	-w1 + w3 >= 5;
 	-w1 + w4 >= 2;
	-w2 + w3 >= 2;
	-w3 + w5 >= 2;
	-w4 + w5 >= 3;
	-w2 + w6 >= 5;
	-w5 + w6 >= 3;
	-w4 + w6 >= 6;
	
   MIN = G;

END

! ------------------------------------------------------ ;

TERSE
GO
TIME
SOLU

divert lpath_dual.out
solu
revert