Max=x1+x2+x3+x4+x5;
x1+x2+x4<=95;
x3+x4+x5<=80;
x1+x4<=82;
x2+x4+x5<=90;
x3+x5<=71;
Global optimal solution found.
Objective value: 166.0000
Infeasibilities: 0.000000
Total solver iterations: 6
Variable Value Reduced Cost
X1 5.000000 0.000000
X2 81.00000 0.000000
X3 71.00000 0.000000
X4 9.000000 0.000000
X5 0.000000 0.000000
Row Slack or Surplus Dual Price
1 166.0000 1.000000
2 0.000000 1.000000
clear all;close all;clc;
f=[-1;-1;-1;-1;-1]; %這個是妳的目標函數是系數
A=[1,1,0,1,0;
0,0,1,1,1;
1,0,0,1,0;
0,1,0,1,1;
0,0,1,0,1]; %這裏是約束的左邊系數,註意這裏是A*x<=b,所以妳的條件中要化為小於等於,所以這裏只選了第1和第2個條件
b=[95;80;82;90;71]; %約束的右邊系數
xmin=[0;0]; %變量的最小值,就是上面的條件(4)
xmax=[inf;inf] %變量的最大值,此例中無,設為無窮大
x0=xmin; %計算的初值
[x,fmin]=linprog(f,A,-b,[],[],xmin,xmax,x0);
x,fmin
x =
31.0632
44.2715
-17.3126
-170.3348
-53.6874
fmin =
166.0000