#define YRS 7
#define PJS 20

continuous  Invest[PJS][YRS],  NetPresVal[PJS], Y[PJS], Z;
double  capital[YRS],req[PJS][YRS],npv[PJS];
int node_cnt;

data()
{
capital = { 640, 430, 390, 290, 350, 290, 320 };

req =	{ 50,50,50,50,50,50,50,
		100,100,0,0,30,30,0,
		90,100,100,70,60,50,50,
		90,80,70,60,50,40,30,
		50,100,100,100,0,0,0,
		60,60,90,20,20,30,30,
		120,40,20,10,10,0,50,
		180,30,20,0,0,0,0,
		55,44,53,22,10,10,10,
		77,55,68,11,0,0,0,
		40,95,80,35,50,44,20,
		30,90,70,0,20,20,0,
		30,90,70,50,50,39,10,
		90,60,70,65,60,22,10,
		30,70,60,90,20,8,0,
		70,100,50,30,0,0,20,
		10,45,20,20,15,0,40,
		80,40,80,33,10,0,0,
		65,34,100,0,0,10,7,
		57,125,40,31,9,0,0 };

npv =	{ 551,497,319,270,430,653,365,300,275,330,
		651,222,529,150,630,530,665,240,175,280 };
}

setup()			// New version
{
	and(int i=0;i<PJS;i++)
		Y[i] <= 1;
	and(int j=0;j<YRS;j++)
		sigma(int i=0;i<PJS;i++) req[i][j]*Y[i]
		<= capital[j];
	Z == sigma(int i=0;i<PJS;i++) npv[i]*Y[i];
}

decide_project(continuous Y) 
{
	either { 
		node_cnt = node_cnt+1;
		Y == 1;
	 }				
	or {
		node_cnt = node_cnt+1; 
		Y == 0;	
	 }	
}

determine_most_likely(int & bv, continuous Y[], int p) 
{
double gauge;
	
	gauge = 0.0;
	bv = p;
	and(int i=0;i<p;i++) 
		if {
			not integral(Y[i]);		// Injured variable ?
			gauge < wp(Y[i]);		// Closer to 1.0 ?
		}
		then {
			bv = i;				// New candidate for branching
			gauge = wp(Y[i]);		// Record witness point value
		}
	bv < p;					// Injury found ?
}

search()
{
int bv;

	and(;;) {				// Standard injury method code
		max: Z;
		if determine_most_likely(bv,Y,PJS);
		then decide_project(Y[bv]);
		else break;
	}
}

quick_and_dirty()
{
double cache;
	not not {						// Progressive round-down
		and(int i=0;i<PJS;i++){
			max: Z;
			Y[i] == floor(Y[i]);
		}
		cache = wp(Z);					// Record the bluff
		printf("The bluff is %.2f\n",Z);
	}
	Z >= cache;						// Enforce the bluff
}

2lp_main()
{
	data();					// Initialize arrays
	setup();					// Resource constraints

	Z == sigma(int i=0;i<PJS;i++) npv[i]*Y[i];
	quick_and_dirty();

	find_max: Z;
	subject_to 
		search();				// Use injury method

	printf("Z is %f\n",Z);
	printf("Node count is %d\n",node_cnt);
}
 