#define M 8      					// Number of constraints
#define N 7      					// Number of variables
#define K 2      					// Number of data sets 

double a[M][N],rhs[M],c[N];
continuous X[N],Z;					 // Z is the objective function

2lp_main()
{
	and(int k=0;k<K;k++)
		if not version(k);
		then printf("Version %d is inconsistent\n",k);
}

version(int k)
{
	data(k);
	and(int i=0;i<M;i++)
		sigma(int j=0;j<N;j++) a[i][j]*X[j] <= rhs[i];
	Z == sigma(int j=0;j<N;j++) c[j]*X[j];
	max: Z;
	printf("Version %d is consistent\n",k);
	printf("With maximum value %f\n",Z);
}	

data(int k)
{
	if k == 0;
	then {
		a = 	{ 15,6,-18,-3,22,11,-6,		// From Table 6.1
			-33,-4,6,7,-8,9,0,
			5,10,8,-11,-65,0,21,
			5,66,-88,33,-21,-56,0,
			19,-32,-36,531,-46,99,16,
			38,-55,0,5,0,17,0,
			10,37,92,-84,0,59,3,
			22,0,-5,12,41,0,56 };

		rhs = { 43,32,-28,41,-77,0,2,71 };

		c = { 3,55,22,18,7,9,6 };

		return;
	}

	if k == 1;
	then { 
		a =	{ 5, -6, 8,-3,22,11,-6,		// From Table 6.2
			7,-4,6,7,-8,9,0,
			5,0,8,-11,-65,44,21,
			4,66,-88,33,-21,-56,73,
			9,-32,136,531,-46,99,16,
			38,-55,0,5,0,17,0,
			0,37,92,-84,0,59,3,
			0,0,0,12,41,0,56 };

		rhs = { 43,-32,28,41,-77,0,2,71 };

		c = { 3,55,22,18,7,9,6 };

		return;
	}
}
 