MODEL: LongestPath - Primal

DATA:
! Input the coefficients to avoid hardwiring the data - optional;      
ENDDATA

! Objective function to be maximized;

  [OBJ] F = 4*x1 + 5*x2 + 2*x3 + 2*x4 + 2*x5 + 3*x6 + 5*x7 + 3*x8 + 6*x9;

! Network Flow equations;

	- x1 - x2 - x3 = -1;
	x1 - x4 - x7 = 0;
	x2 + x4 - x5 = 0;
	x3 - x6 - x9 = 0;
	x5 + x6 - x8 = 0;
	x7 + x8 + x9 = 1;

  MAX = F;

END
! ------------------------------------------------------ ;

TERSE
GO
TIME
SOLU

divert lpath_prim.out
solu
revert