#define MODS 12
#define PARTS 15
#define TOTNZ 60

continuous Bike[MODS];
continuous Z;		// For objective function
double income[MODS],cffs[TOTNZ],hi[MODS],avail[PARTS];
double lo[MODS];
int indices[TOTNZ],nnz[PARTS];

2lp_main()
{
	data();
	setup();
	management_constraint();

	and(int i=0;i<MODS;i++) // From 0 to MODS-1
		decide(Bike[i],lo[i]);  // Second version

	max: Z;  // There is still a linear program left

	printf("The projected revenue is %0.f\n",Z);

//	detailed_output(); // Left to reader
}

data()
{
	nnz = { 3, 4, 4, 3, 4,3, 5, 5, 6, 4, 4, 4, 4, 4, 3 };	// Number of Cycles Requiring Part

	indices =       { 0, 2, 4,			// Cycles Requiring Part
				0, 1, 4, 5,
				1, 2, 6, 11,
				3, 4, 5,
				4, 6, 7, 8,
				6, 7, 8,
				3, 5, 6, 7, 8,
				3, 4, 9, 10, 11,
				1, 4, 6, 7, 8, 9,
				3, 4, 10, 11,
				2, 6, 9, 4,
				3, 4, 5, 9,
				3, 4, 10, 11,
				2, 4, 6, 9,
				5, 9, 10 };

	cffs =   { 2, 3, 12,			// Quantity of Part Required by Cycle
			10, 4, 4, 4,
			1, 4, 1, 2,
			3, 1, 2,
			1, 4, 16, 2,
			2, 12, 12,
			1, 1, 4, 3, 5,
			12, 10, 1, 1, 5,
			1, 10, 2, 1, 3, 3,
			14, 4, 1, 1,
			3, 4, 12, 4,
			12, 2, 10, 1,
			4, 4, 1, 1,
			3, 1, 12, 4,
			2, 12, 1 };
	
	avail = { 1100, 1200, 1650, 1822, 1411, 820, 1950,	// Number of Part Available 
                1910, 1130, 1230, 950, 632, 831, 920, 950 };

	income = { 60, 100, 60, 150, 50, 120, 160, 150, 130, 200, 120, 140 };	//Profit

	hi = { 280, 250, 300, 555, 125, 125, 160, 150, 333, 434, 300, 400 };	// Limit

	lo = {120, 100, 200, 50, 50, 100, 100, 125, 150, 150, 250, 330 };
}

setup()
{
	// Bounds
	and(int i=0;i<MODS;i++) 
		Bike[i] <= hi[i];

	// Objective function
	Z == sigma(int i=0;i<MODS;i++) income[i]*Bike[i];

	// Sparse resource constraints
	sparslteq(Bike,nnz,indices,cffs,avail,PARTS);
}

sparslteq(continuous X[],int nnz[],indices[],double cffs[],rhs[],int m) 
{
int begin,end;

	end = 0;
	and(int i=0;i<m;i++) {
		begin = end;
		end = end + nnz[i];
		sigma(int j=begin;j<end;j++) 
			cffs[j]*X[indices[j]] <= rhs[i];
	}
}

management_constraint()
{
		sigma(int i=0;i<MODS;i++) 	Bike[i] >= 900;
}

/*
decide(continuous Bike, double low)     // first version 
{ 
	either Bike == 0; 
	or Bike >= low;
}
*/

decide(continuous Bike, double low)     //second version
{
	either Bike >= low; 
	or Bike == 0;
}
 