We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://blog.lssyes.com/2021/04/06/sxjm11/
1.1 线性规划问题线性规划（Linear Programming 简记 LP） 1.1.1 线性规划的实例与定义==目标函数及约束条件均为线性函数，故被称为线性规划问题== 1.1.2 线性规划问题的解的概念 可行解： 满足约束条件 $(1.4)$ 的解 $x = [ x_1,L,X_n ]^T$ 最优解： 使目标函数 $(1.3)$ 达到最优的解 可行域： 所有可行解构成的集合成为问题的可
The text was updated successfully, but these errors were encountered:
No branches or pull requests
https://blog.lssyes.com/2021/04/06/sxjm11/
1.1 线性规划问题线性规划（Linear Programming 简记 LP） 1.1.1 线性规划的实例与定义==目标函数及约束条件均为线性函数，故被称为线性规划问题== 1.1.2 线性规划问题的解的概念 可行解： 满足约束条件$(1.4)$ 的解 $x = [ x_1,L,X_n ]^T$ 最优解： 使目标函数 $(1.3)$ 达到最优的解 可行域： 所有可行解构成的集合成为问题的可
The text was updated successfully, but these errors were encountered: