交替方向乘子法This User's Guide describes the functionality and basic usage of the Matlab package YALL1 for L1 minimization. The one-for-six algorithm used in the YALL1 solver is briey introduced in the appendix.
单纯形法：
#导入包
from scipy import optimize
import numpy as np
#确定c,A,b,Aeq,beq
c = np.array([115,90])
A = np.array([[10,20],[4,16],[15,10]])
b = np.array([200,128,220])
#Aeq = np.array([[1,-1,1]])
#beq = np.array([2])
#求解
res = optimize.linprog(-c,A,b)
p
