原理:我也懒得去了解了,反正不怎么用到
学习:推荐看博客https://www.cnblogs.com/ECJTUACM-873284962/p/7097864.html
使用形态:
下面模板的输入:
Max x1 + 14* x2 + 6*x3
s . t . x1 + x2 + x3 <= 4
x1<= 2
x3 <= 3
3*x2 + x3 <= 6
x1,x2,x3 >= 0
我们可以得到其松弛形式:
Max x1 + 14*x2 + 6*x3
s.t. x1 + x2 + x3 + x4 = 4
x1 + x5 = 2
x3 + x6 = 3
3*x2 + x3 + x7 = 6
x1 , x2 , x3 , x4 , x5 , x6 , x7 ≥ 0
时间复杂度O(knm),k为常数,n为变量个数,m为关系数
#include <bits/stdc++.h>
using namespace std;
vector<vector<double> > Matrix;
double Z;
set<int> P;
size_t cn, bn;
bool Pivot(pair<size_t, size_t> &p)//返回0表示所有的非轴元素都小于0
{
int x = 0, y = 0;
double cmax = -INT_MAX;
vector<double> C = Matrix[0];
vector<double> B;
for( size_t i = 0 ; i < bn ; i++ )
{
B.push_back(Matrix[i][cn-1]);
}
for( size_t i = 0 ; i < C.size(); i++ )//在非轴元素中找最大的c
{
if( cmax < C[i] && P.find(i) == P.end())
{
cmax = C[i];
y = i;
}
}
if( cmax < 0 )
{
return 0;
}
double bmin = INT_MAX;
for( size_t i = 1 ; i < bn ; i++ )
{
double tmp = B[i]/Matrix[i][y];
if( Matrix[i][y] != 0 && bmin > tmp )
{
bmin = tmp;
x = i;
}
}
p = make_pair(x, y);
for( set<int>::iterator it = P.begin() ; it != P.end() ; it++)
{
if( Matrix[x][*it] != 0 )
{
//cout<<"erase "<<*it<<endl;
P.erase(*it);
break;
}
}
P.insert(y);
//cout<<"add "<<y<<endl;
return true;
}
void pnt()
{
for( size_t i = 0 ; i < Matrix.size() ; i++ )
{
for( size_t j = 0 ; j < Matrix[0].size() ; j++ )
{
cout<<Matrix[i][j]<<"\t";
}
cout<<endl;
}
cout<<"result z:"<<-Matrix[0][cn-1]<<endl;
}
void Gaussian(pair<size_t, size_t> p)//行变换
{
size_t x = p.first;
size_t y = p.second;
double norm = Matrix[x][y];
for( size_t i = 0 ; i < cn ; i++ )//主行归一化
{
Matrix[x][i] /= norm;
}
for( size_t i = 0 ; i < bn && i != x; i++ )
{
if( Matrix[i][y] != 0)
{
double tmpnorm = Matrix[i][y];
for( size_t j = 0 ; j < cn ; j++ )
{
Matrix[i][j] = Matrix[i][j] - tmpnorm * Matrix[x][j];
}
}
}
}
void solve()
{
pair<size_t, size_t> t;
while(1)
{
pnt();//打印矩阵用的
if( Pivot(t) == 0 )
{
return;
}
cout<<t.first<<" "<<t.second<<endl;
for( set<int>::iterator it = P.begin(); it != P.end() ; it++ )
{
cout<<*it<<" ";
}
cout<<endl;
Gaussian(t);
}
}
int main()
{
freopen("t.txt","r",stdin);
cin>>cn>>bn;
for( size_t i = 0 ; i < bn ; i++ )
{
vector<double> vectmp;
for( size_t j = 0 ; j < cn ; j++)
{
double tmp = 0;
cin>>tmp;
vectmp.push_back(tmp);
}
Matrix.push_back(vectmp);
}
for( size_t i = 0 ; i < bn-1 ; i++ )
{
P.insert(cn-i-2);
}
solve();
}
//复杂度O(knm),k为常数,n为变量个数,m为关系数
/
//glpk input:
///* Variables */
//var x1 >= 0;
//var x2 >= 0;
//var x3 >= 0;
///* Object function */
//maximize z: x1 + 14*x2 + 6*x3;
///* Constrains */
//s.t. con1: x1 + x2 + x3 <= 4;
//s.t. con2: x1 <= 2;
//s.t. con3: x3 <= 3;
//s.t. con4: 3*x2 + x3 <= 6;
//end;
/
//myinput:
/*
8 5
1 14 6 0 0 0 0 0
1 1 1 1 0 0 0 4
1 0 0 0 1 0 0 2
0 0 1 0 0 1 0 3
0 3 1 0 0 0 1 6
*/
/