搜索资源列表
源程序3
- 运筹学单纯形法解线性规划问题c语言源程序。-tacticians simplex method for solving linear programming problems c source language.
xianxingguihua
- 求线性规划的“单纯形”法源程序,用C编写
danchunxing
- 用单纯形法解线性规划问题 C语言编写 C++环境开发
LinearProg.cpp
- 单纯形线性规划源代码,代码简洁用于求解线性规划问题。GNU C++下编译通过。写成了类,直接调用接口即可。-Simplex linear programming source code, code used to solve simple linear programming problem. Under the GNU C++ compiler through. Written in a category, you can directly call the interface.
shuxuesuanfa
- 包括分枝定界算法,线性规划单纯形算法,马尔可夫链算法,贝叶斯决策方法,生产计划算法,动态规划的投资问题的C语言解决-Including the branch-and-bound algorithm, linear programming simplex algorithm, Markov chain algorithms, Bayesian decision-making methods, production planning algorithms, dynamic programming i
linear
- 线性规划单纯形算法,包括子函数和主程序,用c++编写-Linear programming simplex algorithm
simplex_PB06001091
- 线性规划问题的单纯形法的一个实现,c语言实现版本,比较简单-an implement of simplex of lp problem
danchun
- 用单纯形法求解线性规划最优解,能输出求解过程中产生的单纯形表,并输出最优解-Simplex method for solving linear programming optimal solution, can solve the output generated in the process of simplex tableau, and output the optimal solution
yunchou
- 利用单纯形法解决线性规划问题,是利用c++实现的。。希望能对大家有所帮助 -Use simplex method to solve linear programming problems is to use c++ implementation. . Hope you can help
1
- 单纯形法,可在C++环境下运行,可用于线性规划问题的求解-Simplex method can be run under C++ environment can be used for solving linear programming problems
simplex
- 用单纯形法中的人工变量法求解线性规划问题,C语言实现-Simplex method of artificial variables for solving linear programming, C language
MyClass
- 线性规划单纯形法的简单c++实现。可以解较为简单的线性规划方程。-This is about simplex-method of linear-program.It is simply to solve the linear programming equation.
[M]
- 原始单纯形法(大M法,无需给出初始基变量) Programmed by Liyang(faruto s Studio~!) BNU MATH Email:liyangbnu@mail.bnu.edu.cn QQ:516667408 last modified 2008.4.27 求解标准型线性规划:max C*X s.t. A*X=b (b>=0) X>=0 输入:C是n维行向量,A是m*n的系数矩阵,b是m维列向量- Of the origina
SimpleMthd
- 单纯形法matlab程序 求解标准型线性规划:max c*x s.t. A*x=b x>=0 本函数中的A是单纯初始表,包括:最后一行是初始的检验数,最后一列是资源向量b N是初始的基变量的下标 输出变量sol是最优解, 其中松弛变量(或剩余变量)可能不为0 输出变量val是最优目标值,kk是迭代次数- example:max 2*x1+3*x2 s.t. x1+2*x2<=8 4*x1<=16 4*x
改进单纯形法
- 改进单纯形法,C++源代码。解线性规划最优解问题。
Linear
- 对一定量的数据进行线性规划的对偶单纯形法用c语言实现-To a certain amount of data of the dual simplex method for linear programming with c language implementation
simplemethod
- c实现的单纯形法,求解线性规划问题的一种解法-c achieved simplex method for solving linear programming problems of a solution
Simplex method for linear programming
- 线性规划中的单纯形法的c实现,代码有测试类,(Simplex method for linear programming)
181268
- 用单纯形法解线性规划问题 C语言编写 C++环境开发()