#define FU 0
#define HA 1
#define HU 2
#define KO 3

#define CHIPS 3
#define STATIONS 4

int chips[CHIPS];
double revenue[STATIONS];
int rqd_chps[CHIPS][STATIONS];
string models[STATIONS];
continuous Workstations[STATIONS],Revenue;

data()
{
	chips = { 6200, 5500, 8800 };
	revenue = { 70, 78.50, 42.50, 230 };
	rqd_chps = { 1, 1, 0, 3,
			     2, 1, 2, 1,
			     1, 1, 1, 3 };
}

constraints()
{
	and(int i=0; i<CHIPS; i++)
	    sigma(int j=0; j<STATIONS; j++) 
		rqd_chps[i][j]*Workstations[j] <= chips[i];
}

objective()
{
	Revenue ==
		sigma(int i=0;i<STATIONS;i++) 
			revenue[i]*Workstations[i];

	max: Revenue;
}

output()
{
	models = {"Fuji", "Hanla", "Huang", "Kosciusko"};

	printf("The plan calls for production of\n");	
	and(int m=0;m<STATIONS;m++)
		printf("%8.2f\t%s models\n",Workstations[m],models[m]);
	printf("Revenue will be %.2f\n",Revenue);
}

one_but_not_the_other(int a,b)
{
	Workstations[a] >= 750;
	Workstations[b] == 0.0;
}

2lp_main()
{
	data();
	constraints();
	objective(); 		// Revenue is maximized here

	Revenue >= .875*wp(Revenue);

	either one_but_not_the_other(FU,HA);
	or one_but_not_the_other(HA,FU);

	either Workstations[HU] == 0.0;
	or Workstations[KO] == 0.0; 

	max: Revenue;

	output();
}
 