#define M 85
#define N 8

2lp_main()
{
double p[N],w[N],lo[N],hi[N];
continuous X[N];

	p = { 9.5, 12.25, 10.75, 7.0, 9.0, 12.50, 4.75, 5.0 };
	w = { 5.00, 7.00, 6.0, 6.50, 9.0, 13.75, 6.25, 9.50 };
	lo = { 0.2, 0.1, 0.2, 0.0, 2.1, 1.4, 0.4, 1.2 };
	hi = { 1.0, 0.4, 1.2, 0.2, 5.1, 3.4, 2.4, 4.2 };
	     
	and(int i=0;i<N;i++) {
		lo[i] <= X[i];
		X[i] <= hi[i];
	}

	sigma(int i=0;i<N;i++) w[i]*X[i] <= M;

	max: sigma(int i=0;i<N;i++) p[i]*X[i];
       
	and(int i=0;i<N;i++)
		printf("Pack %.2f of item %d in knapsack\n",X[i],i);
}
 