test.cpp

单纯形算法

//用例测试文件
#include <iostream>
using namespace std;

#define MAX_G 50	//宏定义 变量个数最大值
#include "danchunxing.cpp"

void main()
{
	float A[MAX_G][MAX_G]={{1,2,1,0,0},{4,0,0,1,0},{0,4,0,0,1}};
	float c[MAX_G]={2,3,0,0,0};
	float b[MAX_G]={8,16,12};
	int xb[MAX_G]={2,3,4};
	float opt;
	opt=DanChunXing(&c[0],A,&b[0],&xb[0],5,3);
	cout<<"目标最优值为:"<<opt<<endl;
	cout<<"对应的最优解为:  ";
	for(int i=0;i<3;i++)
			cout<<'x'<<xb[i]<<' ';
	cout<<endl<<"可以判断基解中是否含有非零的人工变量"<<endl;
}