搜索资源列表
解线性规划的用乘数的单纯形法
- 解线性规划的用乘数的单纯形法-linear programming solution using the multiplier Simplex Method
线性规划的单纯形法c++
- 用c++实现的线性规划的单纯形法-use linear programming to achieve the Simplex Method
单纯型法解线性规划
- 单纯型法解线性规划
线性规划、矩阵全能程序
- 线性规划、矩阵全能程序 商用级别
linerprogram
- 线性规划算法的实现，采用的是单纯型算法，输入方程和变量个数任意-Linear programming algorithm using the simplex algorithm, enter the equation and variable number of arbitrary
dcx
- 单纯形法c程序，能解决任意的线性规划问题，朝方便的-faasfgknjjkgjkojgobfhuh，furhf
line
- 利用C#编写的单纯形表的代码，用于线性规划。大家看看，讨论讨论-Written using C# code for simplex tableau for linear programming. We take a look at, and discussing the
optim
- 最优化函数集,包括线性规划,非线性规划,带约束优化问题等-Optimization function sets, including linear programming, nonlinear programming, constrained optimization problems, etc
simplemethod
- c实现的单纯形法，求解线性规划问题的一种解法-c achieved simplex method for solving linear programming problems of a solution
LiangDuanF
- 两段法解线性规划问题的程序实现，用Matlab实现的附有详细程序和基本介绍-Solving two linear programming problems Matlab implementation, with detailed procedures and a basic introduction to
SIMPLEX
- 一个简单的visual basic 语言编写的单纯形法求解线性规划问题-A simple visual basic language of the simplex method for solving linear programming problems
LinearSolve
- 用MFC开发的图形化单纯形法解线性规划的小程序-MFC graphical development with the simplex method of solving linear programming applet
第01章 线性规划
- 本文着重用线性规划方法求解最优解，里面有详细的线性代数的matlab代码(Solving the optimal value)
多目标线性规划的求解方法及MATLAB实现
- 数学建模中会用到的常用MATLAB代码，可以求解线性规划的问题(Mathematical modeling will use the commonly used MATLAB code, you can solve the problem of linear programming)
线性规划
- 解线性规划题目，数学建模必备！从最基本的开始介绍，傻瓜式必懂笔记！(Solving linear programming problems, mathematical modeling necessary!)
第10章 线性规划
- 线性规划算法的MATLAB程序，经典算法的程序，比较好用(MATLAB program of linear programming algorithm. This is a classic algorithm, and it is relatively easy to use.)
线性规划
- MATLAB算法线性规划问题，基本涵盖经常使用的MATLAB线性规划程序(MATLAB algorithm linear programming problem, basically covers the often used MATLAB linear programming procedures)
用分枝定界法求解整数线性规划问题
- matlab代码，用分枝定界法求解整数线性规划问题。(Matlab code, use the branch and bound method for solving integer linear programming problem.)
线性规划
- 建立优化模型，确定优化变量，利用线性规划算法进行优化，仿真结果图片显示。(The optimization model is established, the optimization variables are determined, the linear programming algorithm is used to optimize the results, and the simulation results are displayed.)
guosai
- 用模拟退火算法求解线性规划问题。 min f(x)=x1^2+x2^2+8 st. x1^2-x2>=0 -x1-x2^2+2=0 x1,x2>=0(The simulated annealing algorithm is used to solve the linear programming problem. min f(x)=x1^2+x2^2+8 st. x1^2-x2>=0 -x1-x2^2+2=0 x1,x2>