int wneeded[168];
continuous Pct[168];
continuous Z;			// For the objective function

2lp_main(){

wneeded = {			// Data from Table 2.1
30,24,18,15,14,14,15,25,34,36,38,40,
41,43,46,57,57,59,61,59,55,50,45,38,
32,25,20,17,15,13,17,25,32,35,38,40,
42,43,47,58,57,57,59,57,55,52,47,41,
33,25,20,17,15,13,15,25,32,33,37,39,
42,43,47,57,56,57,57,56,53,50,47,41,
34,27,22,19,16,15,16,25,31,35,37,40,
44,45,48,57,57,56,58,56,53,53,46,41,
34,28,23,19,16,15,17,25,33,37,39,42,
45,47,51,59,58,60,61,61,57,56,57,55,
48,41,35,30,26,20,18,22,26,32,42,46,
49,53,54,56,56,56,59,59,57,57,56,56,
52,46,41,34,29,23,18,19,25,31,36,41,
46,50,52,53,52,53,54,53,50,49,45,40
};

	Z == sigma(int h=0;h<168;h++) Pct[h];		// Objective

	and(int k=0;k<7;k++)					// Union requirements
		and(int j=1;j<=4;j++)
			Pct[24*k+j] == 0.0;

	and(int h=0;h<168;h++)					// Staffing requirements
		wneeded[h] <=
			sigma(int k=0; k<5; k++) (
				sigma(int j=k*24; j<k*24+8; j++)
						Pct[ (h+168-j)%168 ]
						- 
						Pct[ (h+168-(k*24+4))%168 ] 
			) ;

	min: Z;
	printf("The linear minimum is %.2f\n",Z);
	printf("Naive roundoff yields %.0f PCTs\n",
					sigma(int h=0;h<168;h++)ceil(Pct[h]));

	and(int i=0;i<168;i++) {					// Progressive roundoff
		min: Z;
		Pct[i] == ceil(Pct[i]);
	}

	printf("Progressive roundoff yields %.0f\n",Z);
}

 