gra sim

#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
//#include"quick.cpp"
partition(float x[],int lb,int ub)
{
	int up,down;
	float a;
	a=x[lb];
	up=ub;
	down=lb;
	while(down<up)
	{
		while(x[down]<=a && down<=up)
		down++;
		while(x[up]>a)
		up--;
		if(down<up)
		{
			float t=x[down];
			x[down]=x[up];
			x[up]=t;
		}
	}
	x[lb]=x[up];
	x[up]=a;
	return(up);
}

quick(float x[],int lb,int ub)
{
	if(lb>ub)
		return(0);
	int j=partition(x,lb,ub);
	quick(x,lb,j-1);
	quick(x,j+1,ub);
}
void main()
{
 clrscr();
 int m,n,i,k,l,j;
 float a[100][100],b[100],temp,temp2;
 cout<<"Enter the no of equations : ";
 cin>>m;
 cout<<"Enter the no of variables : ";
 cin>>n;

 for(i=0;i<m+1;i++)
 {
  for(k=0;k<n+m+1;k++)
  {
   cin>>a[i][k];
  }
 }
 for(i=0;i<m+1;i++)
 {          cout<<"\n";
  for(k=0;k<n+m+1;k++)
  {
   cout<<"\t"<<a[i][k];
  }
 }
 for(i=0;i<n+m+1;i++)
 {b[i]=a[0][i];}

 quick(b,0,n+m);
  for(i=0;i<n+m+1;i++)
  {if(b[0]==a[0][i])
  break;}
  if(abs(a[0][i])==a[0][i])
  exit(0);

 getch();
}

mmethod

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<string.h>
#include<alloc.h>

printmat(float **,int,int,int,int,int,char **,char **);
void LinkFloat();

typedef struct pivot{
							int row;
							int col;
							float val;
							};

void main()
{
	FILE *fp;
	int eqn,var,col,i,j,k,temp_i,temp_j,basic,nonbasic,LOOP=0,choice,less,more,equal,answer=0,FANSI=0,UNBOUND=0;
	float num,**p,temp,rconst,pvconst,fconst;
	float *p1,p2;
	int M=100;
	struct pivot pelement;
	char fname[12];
	char lessthan[] ="<=";
	char morethan[] =">=";
	char equalto[] = "=";
	char **eqntype;
	char objtype;
	char **basicvars,**allvars,k1[5],k0[5];
	char *bvar1,bvar2,*avar1,avar2;
	int turnless=1,turnarti=1,turncol=0;
	p1=&p2;
	p2=*p1;
	p=&p1;
	bvar1=&bvar2;
	bvar2=*bvar1;
	basicvars=&bvar1;

	avar1=&avar2;
	avar2=*avar1;
	allvars=&avar1;
	clrscr();
	LinkFloat();
	textcolor(LIGHTBLUE);

	cprintf("               1.Create a new file   \r\n");
	cprintf("               2.Read from existing file   \r\n");
	cprintf("                   Enter choice:");
	textattr(CYAN);
	scanf("%d",&choice);
	switch(choice)
	{

	case 1:
	cprintf("\r\n          Enter the name of new file:");
	scanf("%s",fname);
	cprintf("\r\n          Enter the no. of equations	 :      ");
	scanf("%d",&eqn);
	eqn++;
	cprintf("\r\n          Enter the no. of variables	 :      ");
	scanf("%d",&var);
	var++;
	printf("\nEnter the no. of '<=' constraints : ");
	scanf("%d",&less);
	printf("\nEnter the no. of '>=' constraints : ");
	scanf("%d",&more);
	printf("\nEnter the no. of '=' constraints : ");
	scanf("%d",&equal);
	printf("Enter the type of Objective fn.('m' for min / 'M' for max) : ");
	fflush(stdin);
	scanf("%c",&objtype);
	col= var+(less*1)+(more*2)+(equal*1)+1;
	allvars=(char**)malloc(col*sizeof(char*));
	for(i=0;i<col;i++)
		allvars[i]=(char*)malloc(5*sizeof(char));
	for(turncol=1;turncol<var;turncol++)
	{
		sprintf(k0,"x[%d]",turncol);
		strcpy(allvars[turncol],k0);
	}
	p=(float**)malloc(eqn*sizeof(float));
	for(i=0;i<eqn;i++)
		p[i]=(float*)malloc(col*sizeof(float));
	eqntype=(char**)malloc((eqn-1)*sizeof(char*));
	for(i=0;i<(eqn-1);i++)
		eqntype[i]=(char*)malloc(3*sizeof(char));
	for(i=0;i<eqn;i++)
	 {
		for(j=0;j<col;j++)
		{
			num=0;
			p[i][j]=num;
		}

	}
	for(i=0;i<eqn;i++)
	{
		if(i==0)
		cprintf("\r\nEnter the coefficients of Objective function : ");
		else
		cprintf("\r\nEnter the coefficients of Constraint %d : ",i);
		for(j=0;j<var;j++)
		{
			 if(i==0 && j==(var-1))
				continue;
			 textattr(LIGHTGRAY);
			 if(j==var-1)
			 {
				printf("   SIGN: ");
				scanf("%s",eqntype[i]);
				printf("   RHS: ");
			 }
			 scanf("%f",&num);
			 p[i][j]=num;
			 if(j==(var-1))
			 {

				temp=p[i][j];
				j=(col-2);
				p[i][j]=temp;
				j=var-1;
				p[i][j]=0;

			 }
		}

	}
	for(j=0,i=0;j<col;j++)
	{
		num=p[i][j];
		if(num==0)
			{
				continue;
			}
		num= -num;
		p[i][j]= num;
	}
	basicvars=(char**)malloc((eqn-1)*sizeof(char*));
	for(i=0;i<(eqn-1);i++)
		basicvars[i]=(char*)malloc(5*sizeof(char));

	for(i=1;i<eqn;i++)
	{

		if(strcmp(eqntype[i],lessthan)==0)
		{
			j=(var+i-2);
			num=1;
			p[i][j]=num;
			sprintf(k1,"s[%d]",turnless);
			strcpy(basicvars[i],k1);
			printf("basicvar : %s",basicvars[i]);
			strcpy(allvars[turncol],k1);
			printf("allvar : %s",allvars[turncol]);
			turnless++;
			turncol++;
		}
		if(strcmp(eqntype[i],equalto)==0)
		{
			j=(var+i-2);
			num=1;
			p[i][j]=num;
			if(objtype=='m')
			{
				p[0][j]=-M;
				for(k=0;k<(col-1);k++)
				p[0][k]=p[0][k]+M*p[i][k];
			}
			if(objtype=='M')
			{
				p[0][j]=M;
				for(k=0;k<(col-1);k++)
				p[0][k]=p[0][k]-M*p[i][k];
			}
			sprintf(k1,"R[%d]",turnarti);
			strcpy(basicvars[i],k1);
			printf("basicvar : %s",basicvars[i]);
			strcpy(allvars[turncol],k1);
			printf("allvar : %s",allvars[turncol]);
			turnarti++;
			turncol++;

		}
		if(strcmp(eqntype[i],morethan)==0)
		{
			j=(var+i-2);
			num= -1;
			p[i][j]=num;
			j=(var+i-1);
			num=1;
			p[i][j]=num;
			if(objtype=='M')
			{
				p[0][j]=M;
				for(k=0;k<(col-1);k++)
				p[0][k]=p[0][k]-M*p[i][k];
			}

			if(objtype=='m')
			{
				p[0][j]=-M;
				for(k=0;k<(col-1);k++)
				p[0][k]=p[0][k]+M*p[i][k];
			}
			sprintf(k1,"S[%d]",turnarti);
			strcpy(allvars[turncol],k1);
			turncol++;
			sprintf(k1,"R[%d]",turnarti);
			strcpy(basicvars[i],k1);
			printf("basicvar : %s",basicvars[i]);
			strcpy(allvars[turncol],k1);
			printf("allvar : %s",allvars[turncol]);
			turnarti++;
			turncol++;
		}
	}
	getch();


	fp=fopen(fname,"wb");
	fwrite(&eqn,sizeof(int),1,fp);
	fwrite(&var,sizeof(int),1,fp);
	fwrite(&col,sizeof(int),1,fp);
	fwrite(&objtype,sizeof(char),1,fp);
	for(i=0;i<col;i++)
		fwrite(allvars[i],5*sizeof(char),1,fp);
	for(i=1;i<eqn;i++)
		fwrite(basicvars[i],5*sizeof(char),1,fp);
	for(i=0;i<eqn;i++)
	{
		for(j=0;j<col;j++)
		{
			fwrite(&p[i][j],sizeof(float),1,fp);
		}
	}
	fclose(fp);
	cprintf("\r\n         \"INITIAL MATRIX\"\r\n");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	break;

	case 2:
	clrscr();
	textcolor(CYAN);
	cprintf("\r\n        Enter the name of file:");
	textattr(CYAN);
	scanf("%s",fname);
	fp=fopen(fname,"rb");
	if(fp==NULL)
	{
		printf("File could not be opened");
		break;
	}
	fread(&eqn,sizeof(int),1,fp);
	fread(&var,sizeof(int),1,fp);
	fread(&col,sizeof(int),1,fp);
	fread(&objtype,sizeof(char),1,fp);
	p=(float**)malloc(eqn*sizeof(float));
	for(i=0;i<eqn;i++)
		p[i]=(float*)malloc(col*sizeof(float));

	allvars=(char**)malloc(col*sizeof(char*));
	for(i=0;i<col;i++)
		allvars[i]=(char*)malloc(5*sizeof(char));

	basicvars=(char**)malloc((eqn-1)*sizeof(char*));
	for(i=0;i<(eqn-1);i++)
		basicvars[i]=(char*)malloc(5*sizeof(char));

	for(i=0;i<col;i++)
		fread(allvars[i],5*sizeof(char),1,fp);
	for(i=1;i<eqn;i++)
		fread(basicvars[i],5*sizeof(char),1,fp);
	for(i=0;i<eqn;i++)
	{
		for(j=0;j<col;j++)
		{
			fread(&num,sizeof(float),1,fp);
			p[i][j]=num;
		}
	}
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	getch();
	fclose(fp);

	break;
}

	/**************searching the least no. in z ******************/
	switch(objtype)
	{
	case 'M':          /******** when O.F. is to maximize ********/

	do
	{

	temp=p[0][0];
	pelement.col=0;
	LOOP=0;

	for(j=0,i=0;j<(col-2);j++)
	{
		if(temp>p[i][j])
		{
			temp=p[i][j];
			pelement.col=j;
		}
	}
	if (temp<0)
		LOOP=1;
	else
	{
		LOOP=0;
		break;
	}
	cprintf("\r\n\r\n		  Entering variable : %s",allvars[pelement.col+1]);
	getch();
	/****************ratio*****************/
	for(i=1,j=pelement.col;i<eqn;i++)
	{
		if(p[i][j]==0)
			continue;
		p[i][col-1]=(p[i][col-2])/p[i][j];
	}
	/******finding pivot element by finding the least ratio******/
	temp=p[1][col-1];
//	temp_i=1;
	pelement.row=1;
	while(temp<=0)
	{
		pelement.row++;
		temp=p[pelement.row][col-1];
	}

	for(i=1,j=col-1;i<eqn;i++)
	{
		if(temp>p[i][j] && p[i][j]>0)
		{
			temp=p[i][j];
			pelement.row=i;
		}
	}
	getch();
	cprintf("\r\n\r\n                \"RATIO\"\r\n");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	cprintf("\r\n\r\n		Outgoing variable : %s",basicvars[pelement.row]);
	basicvars[pelement.row]=allvars[pelement.col+1];
	getch();
	 /*********making the pivot element 1***********/

	pelement.val=p[pelement.row][pelement.col];
	for(j=0,i=pelement.row;j<col;j++)//only making 1
	{
		if(p[i][j]==0)
			continue;
		p[i][j]=(p[i][j])/pelement.val;
	}
	for(i=0;i<eqn;i++)//making ZERO's
	{
		if(i==pelement.row)
			continue;
		pvconst=p[i][pelement.col];
		if(pvconst==0)
			continue;
		for(j=0;j<(col-1);j++)
		{
			p[i][j]=p[i][j]-(p[pelement.row][j]*pvconst);
		}

	}
	cprintf("\r\n\r\n                   \"MAKE ZERO\"\r\n ");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);

	}while(LOOP==1);
	break;

	case 'm':
	do                       /******** when O.F. is to minimize ********/
	{

	temp=p[0][0];
	pelement.col=0;
	LOOP=0;

	for(j=0,i=0;j<(col-2);j++)
	{
		if(temp<p[i][j])
		{
			temp=p[i][j];
			pelement.col=j;
		}
	}
	if (temp>0)
		LOOP=1;
	else
	{
		LOOP=0;
		break;
	}
	cprintf("\r\n\r\n		   Entering variable : %s",allvars[pelement.col+1]);
	getch();
	/****************ratio*****************/
	for(i=1,j=pelement.col;i<eqn;i++)
	{
		if(p[i][j]<=0)
		{
			UNBOUND++;
			continue;
		}
	}
		if(UNBOUND==(eqn-1))
		{

			cprintf("\r\n                  UNBOUNDED SOLUTION");
			break;
		}
	for(i=1,j=pelement.col;i<eqn;i++)
	{
		if(p[i][j]==0)
			continue;
		p[i][col-1]=(p[i][col-2])/p[i][j];
	}

	/******finding pivot element by finding the least ratio******/
	temp=p[1][col-1];
//	temp_i=1;
	pelement.row=1;
	while(temp<=0)
	{
		pelement.row++;
		temp=p[pelement.row][col-1];
	}

	for(i=1,j=col-1;i<eqn;i++)
	{
		if(temp>p[i][j] && p[i][j]>0)
		{
			temp=p[i][j];
			pelement.row=i;
		}
	}
	getch();
	cprintf("\r\n\r\n                    \"RATIO\"\r\n");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	//nonbasic=pelement.row+var-1;
	cprintf("\r\n\r\n Outgoing variable : %s",basicvars[pelement.row]);
	basicvars[pelement.row]=allvars[pelement.col+1];
	getch();
	 /*********making the pivot element 1***********/

	pelement.val=p[pelement.row][pelement.col];
	for(j=0,i=pelement.row;j<col;j++)//only making 1
	{
		if(p[i][j]==0)
			continue;
		p[i][j]=(p[i][j])/pelement.val;
	}
	for(i=0;i<eqn;i++)//making ZERO's
	{
		if(i==pelement.row)
			continue;
		pvconst=p[i][pelement.col];
		if(pvconst==0)
			continue;
		for(j=0;j<(col-1);j++)
		{
			p[i][j]=p[i][j]-(p[pelement.row][j]*pvconst);
		}
	}
	cprintf("\r\n\r\n                       \"MAKE ZERO\"\r\n ");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);

	}while(LOOP==1);
	break;
}
  printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
  for(i=1;i<eqn;i++)
  {
		 if(strchr(basicvars[i],'R'))
			{
			if(p[i][col-2]!=0)
				{
				cprintf("\r\n                    INFEASIBLE SOLUTION");
				FANSI=1;
				}
			else
				continue;
			}
  }
  if(UNBOUND!=(eqn-1))
  {
  if(FANSI!=1)
  {
		cprintf("\r\n\r\n                OPTIMAL SOLUTION ::: Z = %f ", p[0][col-2]);
		for(i=1;i<eqn;i++)
		{
			 if(strchr(basicvars[i],'x'))
				{
				cprintf("\r\n                      %s : %5.2f",basicvars[i],p[i][col-2]);
				answer++;
				}
			 else
				continue;
		}
		if(answer<(eqn-1))
			 cprintf("\r\n                All the other variables are ZERO ");
  }
  }
  getch();
}

printmat(float **p,int eqn,int col,int var,int basic,int nonbasic,char **basicvars,char **allvars)
	{
	int i,j,k;
	float num;
	textcolor(YELLOW);
	cprintf(" \r\n\r\n\r\n  -------------------------------------------------------------------------\r\n");
	textcolor(GREEN);
	cprintf("  Basic    ");
	for(i=1;i<(col-1);i++)
	{

		cprintf("%s     ",allvars[i]);

	}
	cprintf(" sol    ratio\r\n");
	textcolor(YELLOW);
	cprintf("  --------------------------------------------------------------------------\r\n");
	for(i=0;i<eqn;i++)
	{

			 if(i==0)
			 {
				textcolor(GREEN);
				cprintf(" z");
			 }
			 else
			 {
				textcolor(GREEN);
				cprintf("%s",basicvars[i]);
			 }
			 for(j=0;j<col;j++)
			 {
				textcolor(CYAN);

				cprintf("    ");
				cprintf("%5.2f",p[i][j]);
			 }
			 cprintf("\r\n");
	}
	getch();

	}

void LinkFloat()
{
	float *p1,p2=1;
	p1=&p2;
	p2=*p1;
	return;
}

simplex

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<alloc.h>
#define M 10

//function to print the matrix
table(float **,int,int,int,struct name *);//change

//for changing the basic variables
change(struct name *,struct pivot *,int );//ch1

typedef struct pivot{
			int row;
			int col;
			float val;

			};
//for storing the basic variables
typedef struct name{
		char nam;
		int numb;
	   };

void main()
{
	int eqn,var,col,i,j,temp_i,temp_j,basic,nonbasic,LOOP=0;
	char b_name;
	int b_val;
	float num,**p,temp,rconst,pvconst,fconst;
	float *p1,p2;
	struct pivot pelement;
	struct name na[M];
	for(i=0;i<M;i++)
	{
		na[i].nam='s';
		na[i].numb=i;
	}
	p1=&p2;
	p2=*p1;
	p=&p1;
	clrscr();
	printf("\nENTER THE NUMBER OF EQUATIONS : ");
	scanf("%d",&eqn);
	eqn++;
	printf("\nENTER THE NUMBER OF VARIABLES : ");
	scanf("%d",&var);
	var++;
	col= eqn+var;
	p=(float**)malloc(eqn*sizeof(float));
	for(i=0;i<eqn;i++)
		p[i]=(float*)malloc(col*sizeof(float));
	for(i=0;i<eqn;i++)
	{
		for(j=0;j<col;j++)
		{
			num=0;
			p[i][j]=num;
		}

	}
	clrscr();
	printf("\nENTER OBJECTIVE FUNCTION AND CONSTRAINTS :\n");
	for(i=0;i<eqn;i++)
	{
		if(i==0)
		printf("\nOBJECTIVE FUNCTION : ");
		else
		printf("\nCONSTRAINT %d      : ",i);

		for(j=0;j<var;j++)
		{
			 /*IN THE OBJECTIVE FUNCTION THERE IS NO VALUE AFTER
			 THE INEQUALITY*/
			 if(i==0 && j==(var-1))
				continue;
			 if(j==(var-1))
			 /*IF THIS IS LAST COEFFICIENT
			 PUT THE SIGN OF INEQUALITY*/
				printf("<=");
			 scanf("%f",&num);
			 p[i][j]=num;
			 if(j==(var-1))
			 {
			 /*THE VALUE WHICH WE HAVE AFTER INEQUALITY SIGN
			   SHOULD BE GIVEN TO THE SOLUTION COLUMN */
				temp=p[i][j];
				j=(col-2);
				p[i][j]=temp;
				//AGAIN REVERT THE VALUE OF COLUMN
				j=var-1;
				p[i][j]=0;

			 }
		}

	}
	/*THIS IS USE TO REVERT THE VALUE WHICH ARE GIVEN IN THE
	OBJECTIVE FUNCTION IN THE BEGINING*/
	for(j=0,i=0;j<col;j++)
	{
		num=p[i][j];
		if(num==0)
			{
				continue;
			}
		num= -num;
		p[i][j]= num;
	}
	/*THIS IS USED TO PUT "1" TO MAKE THE COLUMN MATRIX IN THE
	SLACK VARIABLE*/
	for(i=1;i<eqn;i++)
	{
		j=(var+i-2);
		num=1;
		p[i][j]=num;
	}

	printf("\n\t\t\t\t\"INITIAL TABLE\"\n");
	table(p,eqn,col,var,na);//change

	/*THIS IS THE LOOP WHICH WILL BE USED IN ORDER TO CHECK THE LEAST
	NUMBER IN THE OBJECTIVE FUNCTION AND QUIT ONCE NO SUCH NUMBER EXIST*/
	do
	{
	temp=p[0][0];
	pelement.col=0;
	LOOP=0;
	for(j=0,i=0;j<(col-2);j++)
	{
		if(temp>p[i][j])
		{
			temp=p[i][j];
			pelement.col=j;//CONTAINS COLUMN OF LEAST ELEMENT
		}
	}
	/*TO EXIT THE LOOP IF THERE IS
	NO NEGATIVE NUMBER IN THE OBJECTIVE FUN*/
	if (temp<0)
		LOOP=1;
	else
	{
		LOOP=0;
		break;
	}

		//ch2 from
		basic=pelement.col;
		if(basic<var-1)
		{
			b_name='x';
			b_val=basic+1;
		}
		else
		{
			b_name='s';
			b_val=basic-(var-1);
		}
	printf("\n\t\tBASIC VARIABLE ==>%c%d",b_name,b_val);

		//ch2 to

	/*ONCE THE COLUMN IS KNOWN IT IS REQUIRED TO FIND THE RATIO */
	for(i=1,j=pelement.col;i<eqn;i++)
	{
		if(p[i][j]==0)
			continue;
		p[i][col-1]=(p[i][col-2])/p[i][j];
	}
	temp=p[1][col-1];
	pelement.row=1;
	while(temp<=0)
	{ /*IN THE RATIO COLUMN FIND THE FIRST ELEMENT WHICH IS NOT <=0*/
		pelement.row++;
		temp=p[pelement.row][col-1];
	}
	printf("\n");
	table(p,eqn,col,var,na);
	getch();/////////////////
	/*SELECT THE LEAST RATIO FROM THE RATIO COLUMN*/
	for(i=1,j=col-1;i<eqn;i++)
	{
		if(temp>p[i][j] && p[i][j]>0)
		{
			temp=p[i][j];
			pelement.row=i;
		}
	}
	//getch();

	//ch2 added
	nonbasic=pelement.row;
	printf("\n\t\tNON BASIC VARIABLE ==> %c%d",na[nonbasic].nam,na[nonbasic].numb);
	getch();

	 /*NOW WE WILL CHANGE THE ROW CONTAINING THE PIVOT ELEMENT,SUCH
	 THAT THE PIVOT ELEMENT IS HAVING VALUE '1'*/
	pelement.val=p[pelement.row][pelement.col];
	for(j=0,i=pelement.row;j<col;j++)//only making 1
	{

		if(p[i][j]==0)
			continue;
		p[i][j]=(p[i][j])/pelement.val;
	}


	for(i=0;i<eqn;i++)
	{
		if(i==pelement.row)
			continue;
		pvconst=p[i][pelement.col];
		/*TAKE THE VALUE IN EACH ROW, IN THE COLUMN WHICH IS
		CONTAINING THE PIVOT ELEMENT AND MAKE IT ZERO  */
		if(pvconst==0)
			continue;
		for(j=0;j<(col-1);j++)
		{
			p[i][j]=p[i][j]-(p[pelement.row][j]*pvconst);
		}
	}
	clrscr();
	printf("\n\n\n\n\t\t\t\t\"OTHER TABLES\"\n ");
	change(na,&pelement,var);
	table(p,eqn,col,var,na);


  }while(LOOP==1);

  clrscr();
  printf("\n\n\n\n\t\t\t\t\"FINAL TABLE\"\n");
  table(p,eqn,col,var,na);
  printf("\n\n\t\tOPTIMAL SOLUTION  Z = %f ", p[0][col-2]);
  printf("\n\n\t\tBASIC VARIABLES =>");
  for(i=1;i<eqn;i++)
  {
	printf("\n\t\t\t %c%d     ",na[i].nam,na[i].numb);
	printf("\t%5.2f",p[i][col-2]);
  }

  getch();
}


table(float **p,int eqn,int col,int var,struct name * na)
	{

	int i,j;
	printf("\t**********************************************************************\n");
	printf("\tBasic");
	for(i=1;i<var;i++)
		printf("\tx%d",i);
	for(i=1;i<eqn;i++)

		printf("\ts%d",i);
	printf("\tsoln.\t ratio\n");
	printf("\t**********************************************************************");
	for(i=0;i<eqn;i++)
	{
			 printf("\n");
			 if(i==0)

		printf("\t |    |\n\t | z  |");
			 else
			 printf("\t | %c%d |",na->nam,na->numb);
			 na++;
			 for(j=0;j<col;j++)
			 {

			printf("\t");
			printf("%5.2f",p[i][j]);
			 }
	}

	getch();

	}


change(struct name * na,struct pivot * pelement,int var)//ch1
{
int i,j;
i=pelement->col;
j=pelement->row;
if(i<var-1)
{
	na+=j;
	na->nam='x';
	na->numb=i+1;
}
else
{
	na+=j;
	na->nam='s';
	na->numb=i-(var-1);
}
}

2phase

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<string.h>
#include<alloc.h>

printmat(float **,int,int,int,int,int,char **,char **);
void LinkFloat();

typedef struct pivot{
							int row;
							int col;
							float val;
							};

void main()
{
	FILE *fp;
	int eqn,var,col,i,j,k,f=0,temp_i,temp_j,basic,nonbasic,LOOP=0,choice,less,more,equal,answer=0,FANSI=0,UNBOUND=0;
	float num,**p,temp,rconst,pvconst,fconst;
	float *p1,p2;
	int M=100;
	float obj_fn[10];
	struct pivot pelement;
	char fname[12];
	char lessthan[] ="<=";
	char morethan[] =">=";
	char equalto[] = "=";
	char **eqntype;
	char objtype;
	char **basicvars,**allvars,k1[5],k0[5];
	char *bvar1,bvar2,*avar1,avar2;
	int turnless=1,turnarti=1,turncol=0;
	p1=&p2;
	p2=*p1;
	p=&p1;
	bvar1=&bvar2;
	bvar2=*bvar1;
	basicvars=&bvar1;

	avar1=&avar2;
	avar2=*avar1;
	allvars=&avar1;
	clrscr();
	LinkFloat();
	textcolor(LIGHTBLUE);

	cprintf("               1.Create a new file   \r\n");
	cprintf("               2.Read from existing file   \r\n");
	cprintf("                   Enter choice:");
	textattr(CYAN);
	scanf("%d",&choice);
	switch(choice)
	{

	case 1:
	cprintf("\r\n          Enter the name of new file:");
	scanf("%s",fname);
	cprintf("\r\n          Enter the no. of constraints	 :      ");
	scanf("%d",&eqn);
	eqn++;
	cprintf("\r\n          Enter the no. of variables	 :      ");
	scanf("%d",&var);
	var++;
	printf("\nEnter the no. of '<=' constraints : ");
	scanf("%d",&less);
	printf("\nEnter the no. of '>=' constraints : ");
	scanf("%d",&more);
	printf("\nEnter the no. of '=' constraints : ");
	scanf("%d",&equal);
	printf("Enter the type of Objective fn.('m' for min / 'M' for max) : ");
	fflush(stdin);
	scanf("%c",&objtype);
	col= var+(less*1)+(more*2)+(equal*1)+1;
	allvars=(char**)malloc(col*sizeof(char*));
	for(i=0;i<col;i++)
		allvars[i]=(char*)malloc(5*sizeof(char));
	for(turncol=1;turncol<var;turncol++)
	{
		sprintf(k0,"x[%d]",turncol);
		strcpy(allvars[turncol],k0);
	}
	p=(float**)malloc(eqn*sizeof(float));
	for(i=0;i<eqn;i++)
		p[i]=(float*)malloc(col*sizeof(float));
	eqntype=(char**)malloc((eqn-1)*sizeof(char*));
	for(i=0;i<(eqn-1);i++)
		eqntype[i]=(char*)malloc(3*sizeof(char));
	for(i=0;i<eqn;i++)
	 {
		for(j=0;j<col;j++)
		{
			num=0;
			p[i][j]=num;
		}

	}
	for(i=0;i<eqn;i++)
	{
		if(i==0)
		cprintf("\r\nEnter the coefficients of Objective function : ");
		else
		cprintf("\r\nEnter the coefficients of Constraint %d : ",i);
		for(j=0;j<var;j++)
		{
			 if(i==0 && j==(var-1))
				continue;
			 textattr(LIGHTGRAY);
			 if(j==var-1)
			 {
				printf("   SIGN: ");
				scanf("%s",eqntype[i]);
				printf("   RHS: ");
			 }
			 scanf("%f",&num);
			 p[i][j]=num;
			 if(i==0)
			 {
					p[i][j]=0;
					obj_fn[f]=num;
					f++;
			 }
			 if(j==(var-1))
			 {

				temp=p[i][j];
				j=(col-2);
				p[i][j]=temp;
				j=var-1;
				p[i][j]=0;

			 }
		}

	}
/*	for(j=0,i=0;j<col;j++)
	{
		num=p[i][j];
		if(num==0)
			{
				continue;
			}
		num= -num;
		p[i][j]= num;
	}    */
	basicvars=(char**)malloc((eqn-1)*sizeof(char*));
	for(i=0;i<(eqn-1);i++)
		basicvars[i]=(char*)malloc(5*sizeof(char));

	for(i=1;i<eqn;i++)
	{

		if(strcmp(eqntype[i],lessthan)==0)
		{
			j=(var+i-2);
			num=1;
			p[i][j]=num;
			sprintf(k1,"s[%d]",turnless);
			strcpy(basicvars[i],k1);
		  //	printf("basicvar : %s",basicvars[i]);
			strcpy(allvars[turncol],k1);
		  //	printf("allvar : %s",allvars[turncol]);
			turnless++;
			turncol++;
		}
		if(strcmp(eqntype[i],equalto)==0)
		{
			j=(var+i-2);
			num=1;
			p[i][j]=num;
		 //	if(objtype=='m')
		 //	{
				p[0][j]=-1;
				for(k=0;k<(col-1);k++)
				p[0][k]=p[0][k]+p[i][k];
		 //	}
		 /*	if(objtype=='M')
			{
				p[0][j]=M;
				for(k=0;k<(col-1);k++)
				p[0][k]=p[0][k]-M*p[i][k];
			}   */
		 //	p[0][j]=-1;
			sprintf(k1,"R[%d]",turnarti);
			strcpy(basicvars[i],k1);
		  //	printf("basicvar : %s",basicvars[i]);
			strcpy(allvars[turncol],k1);
		  //	printf("allvar : %s",allvars[turncol]);
			turnarti++;
			turncol++;
		 /*	for(j=0;j<col;j++)
			{
				p[0][j]=p[0][j]+p[i][j];
			}*/

		}
		if(strcmp(eqntype[i],morethan)==0)
		{
			j=(var+i-2);
			num= -1;
			p[i][j]=num;
			j=(var+i-1);
			num=1;
			p[i][j]=num;
		//  	if(objtype=='M')
		//	{
				p[0][j]=-1;
				for(k=0;k<(col-1);k++)
				p[0][k]=p[0][k]+p[i][k];
		//	}

		/*	if(objtype=='m')
			{
				p[0][j]=-M;
				for(k=0;k<(col-1);k++)
				p[0][k]=p[0][k]+M*p[i][k];
			}     */
	 //		p[0][j]=-1;
			sprintf(k1,"S[%d]",turnarti);
			strcpy(allvars[turncol],k1);
			turncol++;
			sprintf(k1,"R[%d]",turnarti);
			strcpy(basicvars[i],k1);
		  //	printf("basicvar : %s",basicvars[i]);
			strcpy(allvars[turncol],k1);
		  //	printf("allvar : %s",allvars[turncol]);
			turnarti++;
			turncol++;
		/*	for(j=0;j<col;j++)
			{
				p[0][j]=p[0][j]+p[i][j];
			}  */
		}
	}
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	getch();


	fp=fopen(fname,"wb");
	fwrite(&eqn,sizeof(int),1,fp);
	fwrite(&var,sizeof(int),1,fp);
	fwrite(&col,sizeof(int),1,fp);
	fwrite(&objtype,sizeof(char),1,fp);
	for(i=0;i<col;i++)
		fwrite(allvars[i],5*sizeof(char),1,fp);
	for(i=1;i<eqn;i++)
		fwrite(basicvars[i],5*sizeof(char),1,fp);
	for(i=0;i<eqn;i++)
	{
		for(j=0;j<col;j++)
		{
			fwrite(&p[i][j],sizeof(float),1,fp);
		}
	}
	fclose(fp);
	cprintf("\r\n         \"INITIAL MATRIX\"\r\n");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	break;

	case 2:
	clrscr();
	textcolor(CYAN);
	cprintf("\r\n        Enter the name of file:");
	textattr(CYAN);
	scanf("%s",fname);
	fp=fopen(fname,"rb");
	if(fp==NULL)
	{
		printf("File could not be opened");
		break;
	}
	fread(&eqn,sizeof(int),1,fp);
	fread(&var,sizeof(int),1,fp);
	fread(&col,sizeof(int),1,fp);
	fread(&objtype,sizeof(char),1,fp);
	p=(float**)malloc(eqn*sizeof(float));
	for(i=0;i<eqn;i++)
		p[i]=(float*)malloc(col*sizeof(float));

	allvars=(char**)malloc(col*sizeof(char*));
	for(i=0;i<col;i++)
		allvars[i]=(char*)malloc(5*sizeof(char));

	basicvars=(char**)malloc((eqn-1)*sizeof(char*));
	for(i=0;i<(eqn-1);i++)
		basicvars[i]=(char*)malloc(5*sizeof(char));

	for(i=0;i<col;i++)
		fread(allvars[i],5*sizeof(char),1,fp);
	for(i=1;i<eqn;i++)
		fread(basicvars[i],5*sizeof(char),1,fp);
	for(i=0;i<eqn;i++)
	{
		for(j=0;j<col;j++)
		{
			fread(&num,sizeof(float),1,fp);
			p[i][j]=num;
		}
	}
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	getch();
	fclose(fp);

	break;
}

	/**************searching the least no. in z ******************/
	switch(objtype)
	{
	case 'M':          /******** when O.F. is to maximize ********/

	do
	{

	temp=p[0][0];
	pelement.col=0;
	LOOP=0;

	for(j=0,i=0;j<(col-2);j++)
	{
		if(temp>p[i][j])
		{
			temp=p[i][j];
			pelement.col=j;
		}
	}
	if (temp<0)
		LOOP=1;
	else
	{
		LOOP=0;
		break;
	}
	cprintf("\r\n\r\n   Entering variable : %s",allvars[pelement.col+1]);
	getch();
	/****************ratio*****************/
	for(i=1,j=pelement.col;i<eqn;i++)
	{
		if(p[i][j]<=0)
		{
			UNBOUND++;
			continue;
		}
	}
		if(UNBOUND==(eqn-1))
		{

			cprintf("\r\n                  UNBOUNDED SOLUTION");
			break;
		}

	for(i=1,j=pelement.col;i<eqn;i++)
	{
		if(p[i][j]==0)
			continue;
		p[i][col-1]=(p[i][col-2])/p[i][j];
	}
	/******finding pivot element by finding the least ratio******/
	temp=p[1][col-1];
//	temp_i=1;
	pelement.row=1;
	while(temp<=0)
	{
		pelement.row++;
		temp=p[pelement.row][col-1];
	}

	for(i=1,j=col-1;i<eqn;i++)
	{
		if(temp>p[i][j] && p[i][j]>0)
		{
			temp=p[i][j];
			pelement.row=i;
		}
	}
	getch();
	cprintf("\r\n\r\n   \"RATIO\"\r\n");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	cprintf("\r\n\r\n		Outgoing variable : %s",basicvars[pelement.row]);
	basicvars[pelement.row]=allvars[pelement.col+1];
	getch();
	 /*********making the pivot element 1***********/

	pelement.val=p[pelement.row][pelement.col];
	for(j=0,i=pelement.row;j<col;j++)//only making 1
	{
		if(p[i][j]==0)
			continue;
		p[i][j]=(p[i][j])/pelement.val;
	}
	for(i=0;i<eqn;i++)//making ZERO's
	{
		if(i==pelement.row)
			continue;
		pvconst=p[i][pelement.col];
		if(pvconst==0)
			continue;
		for(j=0;j<(col-1);j++)
		{
			p[i][j]=p[i][j]-(p[pelement.row][j]*pvconst);
		}

	}
  //	cprintf("\r\n\r\n                   \"MAKE ZERO\"\r\n ");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);

	}while(LOOP==1);
	break;

	case 'm':
	do                       /******** when O.F. is to minimize ********/
	{

	temp=p[0][0];
	pelement.col=0;
	LOOP=0;

	for(j=0,i=0;j<(col-2);j++)
	{
		if(temp<p[i][j])
		{
			temp=p[i][j];
			pelement.col=j;
		}
	}
	if (temp>0)
		LOOP=1;
	else
	{
		LOOP=0;
		break;
	}
	cprintf("\r\n\r\n     Entering variable : %s",allvars[pelement.col+1]);
	getch();
	/****************ratio*****************/
	for(i=1,j=pelement.col;i<eqn;i++)
	{
		if(p[i][j]<=0)
		{
			UNBOUND++;
			continue;
		}
	}
		if(UNBOUND==(eqn-1))
		{

			cprintf("\r\n                  UNBOUNDED SOLUTION");
			break;
		}
	for(i=1,j=pelement.col;i<eqn;i++)
	{
		if(p[i][j]==0)
			continue;
		p[i][col-1]=(p[i][col-2])/p[i][j];
	}

	/******finding pivot element by finding the least ratio******/
	temp=p[1][col-1];
//	temp_i=1;
	pelement.row=1;
	while(temp<=0)
	{
		pelement.row++;
		temp=p[pelement.row][col-1];
	}

	for(i=1,j=col-1;i<eqn;i++)
	{
		if(temp>p[i][j] && p[i][j]>0)
		{
			temp=p[i][j];
			pelement.row=i;
		}
	}
	getch();
	cprintf("\r\n\r\n    \"RATIO\"\r\n");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
	//nonbasic=pelement.row+var-1;
	cprintf("\r\n\r\n Outgoing variable : %s",basicvars[pelement.row]);
	basicvars[pelement.row]=allvars[pelement.col+1];
	getch();
	 /*********making the pivot element 1***********/

	pelement.val=p[pelement.row][pelement.col];
	for(j=0,i=pelement.row;j<col;j++)//only making 1
	{
		if(p[i][j]==0)
			continue;
		p[i][j]=(p[i][j])/pelement.val;
	}
	for(i=0;i<eqn;i++)//making ZERO's
	{
		if(i==pelement.row)
			continue;
		pvconst=p[i][pelement.col];
		if(pvconst==0)
			continue;
		for(j=0;j<(col-1);j++)
		{
			p[i][j]=p[i][j]-(p[pelement.row][j]*pvconst);
		}

	}
  //	cprintf("\r\n\r\n                       \"MAKE ZERO\"\r\n ");
	printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);

	}while(LOOP==1);
	break;
}
  printmat(p,eqn,col,var,basic,nonbasic,basicvars,allvars);
  for(i=1;i<eqn;i++)
  {
		 if(FANSI==1)
				break;
		 if(strchr(basicvars[i],'R'))
			{
			if(p[i][col-2]!=0)
				{
				cprintf("\r\n                    INFEASIBLE SOLUTION");
				FANSI=1;
				}
			else
				continue;
			}
  }
  if(UNBOUND!=(eqn-1))
  {
  if(FANSI!=1)
  {
		cprintf("\r\n\r\n                OPTIMAL SOLUTION ::: Z = %f ", p[0][col-2]);
		for(i=1;i<eqn;i++)
		{
			 if(strchr(basicvars[i],'x'))
				{
				cprintf("\r\n                      %s : %5.2f",basicvars[i],p[i][col-2]);
				answer++;
				}
			 else
				continue;
		}
		if(answer<(eqn-1))
			 cprintf("\r\n                All the other variables are ZERO ");
  }
  }
  getch();
}
printmat(float **p,int eqn,int col,int var,int basic,int nonbasic,char **basicvars,char **allvars)
	{
	int i,j,k;
	float num;
	textcolor(YELLOW);
	cprintf(" \r\n\r\n\r\n  -------------------------------------------------------------------------\r\n");
	textcolor(GREEN);
	cprintf("  Basic    ");
	for(i=1;i<(col-1);i++)
	{

		cprintf("%s     ",allvars[i]);

	}
	cprintf(" sol    ratio\r\n");
	textcolor(YELLOW);
	cprintf("  --------------------------------------------------------------------------\r\n");
	for(i=0;i<eqn;i++)
	{

			 if(i==0)
			 {
				textcolor(GREEN);
				cprintf(" z");
			 }
			 else
			 {
				textcolor(GREEN);
				cprintf("%s",basicvars[i]);
			 }
			 for(j=0;j<col;j++)
			 {
				textcolor(CYAN);

				cprintf("    ");
				if(i!=0 || j!=(col-1))
					 cprintf("%5.2f",p[i][j]);
			 }
			 cprintf("\r\n");
	}
	getch();
	}
void LinkFloat()
{
	float *p1,p2=1;
	p1=&p2;
	p2=*p1;
	return;
}

2phase 2

//Two-Phase Method

#include<iostream.h>
#include<conio.h>
#include<stdio.h>
#include<string.h>
#include<process.h>
#define TRUE 1
#define FALSE 0

int slack(int i,float arr[][10],int p,int n)
{
	cout<<"Enter coeff. of constraint "<<i-1<<" ";
	for(int j=1;j<=n;j++)
		cin>>arr[i][j];
	arr[i][p]=1;
	p=p+1;
	return p;
}

int equal(int i,float arr[][10],int p,int n,int w)
{
	cout<<"\nEnter coeff. of constraint "<<i-1<<" ";
	for(int j=1;j<=n;j++)
		cin>>arr[i][j];
	arr[i][p]=1;
	arr[1][p]=-1;
	p=p+1;
	return p;
}

int surplus(int i,float arr[][10],int p,int n,int w)
{
	cout<<"\nEnter coeff of constraint "<<i-1<<" ";
	for(int j=1;j<=n;j++)
		cin>>arr[i][j];
	arr[i][p]=-1;
	p=p+1;
	arr[i][p]=1;
	arr[1][p]=-1;
	p=p+1;
	return p;
}

void display(float arr[][10],int p,int n,char strvar1[][6],char strvar2[][6],char str2[][6],int k)
{
getch();
for(int i=0;i<=n;i++)
	cout<<strvar1[i]<<"\t";
for(i=0;i<p-n;i++)
	cout<<strvar2[i]<<"\t";
cout<<"SOLUTION";
cout<<endl;
cout<<"--------------------------------------------------------------------"<<endl;
cout<<"z"<<"  ";
for(i=1;i<=p+1;i++)
printf("%8.2f",arr[1][i]);
cout<<endl;
cout<<"--------------------------------------------------------------------"<<endl;
for(i=0;i<k;i++)
{
cout<<str2[i]<<"  ";
for(int j=1;j<=p+1;j++)
printf("%8.2f",arr[i+2][j]);
cout<<endl;
}
}

void compute(float arr[][10],int p,int k,int w)
{
int j=1;
for(int i=1;i<=p+1;i++)
{
if(arr[1][i]==-1)
{
	int col=j;
	int l=2;
	for(int y=2;y<=k+1;y++)
	{
	if(arr[y][col]==1)
	{
		int row=l;
		for(int t=1;t<=p+1;t++)
		arr[1][t]=arr[1][t]+arr[row][t];

	}
	else
		l++;
	}
j++;
}
else
	j++;
}

}


void compute2(float arr[][10],int s,int k,int w,char strvar1[][6],char strvar2[][6],char str2[][6],int n)
{
//s-->number of columns
//k-->number of rows
//w-->type of objective function

int j=1;
int i=2;
while(i<=k+1)
{
j=1;
while(j<=s)
{
	if(j<=n)
	{
	if(strcmp(str2[i-2],strvar1[j])==0)
	{
		if(arr[i][j]==1 && arr[1][j]!=0)
		{
			int temp=arr[1][j];
			for(int r=1;r<=s+1;r++)
			{
				arr[1][r]=arr[1][r]-temp*arr[i][r];
				if(arr[1][r]>0 && arr[1][r]<=0.009)
				arr[1][r]=0;
			}
		}
		i++;
	}
	else
	{

		j++;
	}
	}
	else
	{
	if(strcmp(str2[i-2],strvar2[j-3])==0)
	{
		if(arr[i][j]==1 && arr[1][j]!=0)
		{
			int temp=arr[1][j];
			for(int r=1;r<=s+1;r++)
			{
				arr[1][r]=arr[1][r]-temp*arr[i][r];
				if(arr[1][r]>0 && arr[1][r]<=0.009)
				arr[1][r]=0;
			}
		}
		i++;
	 }
	else
	{
		j++;
	}
	}
}
}
}


int min(float arr[][10],int m,int n)
{
float min=0;
for(int j=1;j<=m;j++)
{
	if(min>arr[1][j])
	min=arr[1][j];
}
int i=1;
while(min!=arr[1][i])
{
i++;
}
return i;
}

int max(float arr[][10],int m,int n)
{
float max=0;
for(int j=1;j<=m;j++)
{
	if(max<arr[1][j])
	max=arr[1][j];
}
int i=1;
if(max>0)
{
while(max!=arr[1][i])
{
i++;
}

return i;
}
else return(-1);

}

int ratio(float arr[][10],int m,int n,int p)
{
int j=1;
float ratio[50];
for(int i=2;i<=n+1;i++)
{
	if(arr[i][p]>0)
	{
		ratio[j]=arr[i][m+1]/arr[i][p];
		j++;
       }
       else
       {
	ratio[j]=32617;
	j++;
	}
}
float min=ratio[1];
for(int k=1;k<j;k++)
{
	if(min>ratio[k])
	min=ratio[k];
}
int count=2;
while(min!=ratio[count-1])
{
count++;
}
return count;

}


void iteration(float arr[][10],int m,int l,int p,int q,char strvar1[][6],char strvar2[][6],char str2[][6],int n)
{
if(p<=l)
      strcpy(str2[q-2],strvar1[p]);
else
      strcpy(str2[q-2],strvar2[p-l-1]);
float pivot=arr[q][p];
for(int i=1;i<=m+1;i++)
{
	if(arr[q][i]!=0 && pivot!=0)
	arr[q][i]=arr[q][i]/pivot;
}

for(int k=1;k<=n+1;k++)
{
float temp=arr[k][p];
for(int j=1;j<=m+1;j++)
{
	if(k!=q)
	{
	arr[k][j]=arr[k][j]-(temp*arr[q][j]);
	}
}
}
//cout<<"------------------------second table---------------------------"<<endl;
for(int r=1;r<=m+1;r++)
{
if(arr[1][r]>0 && arr[1][r]<=0.009)
arr[1][r]=0;
}
display(arr,m,l,strvar1,strvar2,str2,n);
}


void main()
{
clrscr();
int m,n,i,j;
float arr[50][10],num,temp[10][50];
char strvar1[20][6]={"BASIC","x1","x2","x3","x4","x5","x6","x7"};
char strvar2[20][6]={"s1","s2","s3","s4","s5","s6","s7"};
char str2[20][6];
cout<<"Enter number of equations";
cin>>m;
cout<<"Enter number of variables";
cin>>n;

for(i=1;i<=10;i++)
{
	for(j=1;j<=10;j++)
	{
	arr[i][j]=0;
	temp[i][j]=0;
	}
}

cout<<"enter coeff. of objective function";
for(i=1;i<=n;i++)
{
cin>>num;
//arr[1][i]=-num;
temp[1][i]=-num;
}
int w;
cout<<"\nenter the type of objective function";
cout<<"\n1.maximization";
cout<<"\n2.minimization"<<endl;
cin>>w;

int t,p=n+1,k=0;
i=2;
while(i<=m+1)
{
		cout<<"enter the type of constraint:";
		cout<<"\n1.<=";
		cout<<"\n2.=";
		cout<<"\n3.>="<<endl;
		cin>>t;
		switch(t)
		{
		case 1:
			p=slack(i,arr,p,n);
//			cout<<"p->"<<p<<endl;
			i++;
			strcpy(str2[k],strvar2[p-n-2]);
			k++;
			break;
		case 2:
			p=equal(i,arr,p,n,w);
			i++;
			//cout<<"p-->"<<p;
			strcpy(str2[k],strvar2[p-n-2]);
			k++;
			break;
		case 3:
			p=surplus(i,arr,p,n,w);
			i++;
			strcpy(str2[k],strvar2[p-n-2]);
			k++;
			break;
		default:break;
		}
}
// To enter constants

for(i=2;i<=m+1;i++)
{
cout<<"Enter constant";
cin>>arr[i][p];
}
display(arr,p-1,n,strvar1,strvar2,str2,k);
compute(arr,p-1,k,w);
display(arr,p-1,n,strvar1,strvar2,str2,k);

int FLAG=FALSE;
int r=1;
	while(r<=p)
	{
		if(arr[1][r]>0)
		{
		FLAG=TRUE;
		break;
		}
		else
		r++;
	}

	while(FLAG)
	{
		int col=max(arr,p-1,k);
		if(col!=-1)
		{
		int row=ratio(arr,p-1,k,col);
		iteration(arr,p-1,n,col,row,strvar1,strvar2,str2,k);
		FLAG=FALSE;
		r=1;
		while(r<=p)
		{
			if(arr[1][r]>0)
			{
			FLAG=TRUE;
			cout<<FLAG;
			break;
			}
			else
			r++;
		}
		}
		else
		FLAG=FALSE;
	}

int s=1,count=0;

cout<<"p="<<p<<endl;
for(i=1;i<=p;i++)
{
	if(arr[1][i]!=-1)
	{
		for(int t=2;t<=k+1;t++)
		{
		arr[t][s]=arr[t][i];
		}
		if(i>n)
		{
//			cout<<"=="<<strvar2[i-n-1]<<endl;
			strcpy(strvar2[count++],strvar2[i-n-1]);
		}
		s++;
	}
	else
	continue;
}
for(i=1;i<=s-1;i++)
	arr[1][i]=0;
for(i=1;i<=s-1;i++)
	arr[1][i]=temp[1][i];
cout<<"******************************PHASE2*******************************"<<endl;

display(arr,s-2,n,strvar1,strvar2,str2,k);
compute2(arr,s-2,k,w,strvar1,strvar2,str2,n);
display(arr,s-2,n,strvar1,strvar2,str2,k);

switch(w)
{
case 1:

	int FLAG=FALSE;
	int r=1;
	while(r<=s-2)
	{
		if(arr[1][r]<0)
		{
		FLAG=TRUE;
		break;
		}
		else
		r++;
	}

	while(FLAG)
	{
		int col=min(arr,s-2,k);
       //		cout<<"col-->"<<col<<endl;
		int row=ratio(arr,s-2,k,col);
	 //	cout<<"row-->"<<row<<endl;
		iteration(arr,s-2,n,col,row,strvar1,strvar2,str2,k);
		FLAG=FALSE;
		r=1;
		while(r<=s-2)
		{
			if(arr[1][r]<0)
			{
			FLAG=TRUE;
			cout<<FLAG;
			break;
			}
			else
			r++;
		}
	}
break;/*
	col=min(arr,s-1,k);
	cout<<"col-->"<<col<<endl;
	row=ratio(arr,s-1,k,col);
	cout<<"row-->"<<row<<endl;
	iteration(arr,s-1,n,col,row,strvar1,strvar2,str2,k);
     */

case 2:
{
	FLAG=FALSE;
	r=1;
	while(r<=s-2)
	{
		if(arr[1][r]>0)
		{
		FLAG=TRUE;
		break;
		}
		else
		r++;
	}

	while(FLAG)
	{
		int col=max(arr,s-2,k);
		if(col!=-1)
		{
	   //	cout<<"col-->"<<col<<endl;
		int row=ratio(arr,s-2,k,col);
	     //	cout<<"row-->"<<row<<endl;
		iteration(arr,s-2,n,col,row,strvar1,strvar2,str2,k);
		FLAG=FALSE;
		r=1;
		while(r<=s-2)
		{
			if(arr[1][r]>0)
			{
			FLAG=TRUE;
			cout<<FLAG;
			break;
			}
			else
			r++;
		}
		}
		else
		FLAG=FALSE;
	}
	break;
}
default: exit(1);
	 break;
}

getch();
}