搜索资源列表
LP--simplex
- lp求解的单纯形算法，有c++builder6.0开发-lp for the simplex algorithm, c builder6.0 Development
SIMPLEX
- 用C写的求解线性规划问题,即在一组线性不等式或等式组的约束条件下求某个线性函数的最值问题.-using simplex method to solve the linear program
simplex_algorithm
- 单纯形算法源程序，具有选择是求解目标值的最大还是最小问题，同时也具有可行性变量约束限制-Simplex algorithm source with the target choice is to solve the biggest problem is still the smallest, but also with the feasibility of variable binding constraints
Simplex
- 这是运筹学中关于单纯形算法的c程序，可以运行，而且也比较易懂-simplex method
Revisedsimplexmathod
- 此算法为改进的单纯形算法，也是运筹学中要用到的方法，可以运行的-revised simplex method
simplex
- simplex Fortran code to find the minimum
Simplex
- 线性规划中的单纯形法，单纯形法是求解线性规划的最主要方法，程序首先确定初始可行解，如没有找到，则引入人工变量或松弛变量来求解-Of linear programming simplex method, simplex method for solving linear programming are the most important methods, procedures to determine first of all, the initial feasible solution, su
SIMPLEX
- 运筹学线性规划算法代码，只是用C语言求解而已。过程算法靠自己弄明白了，有高手最好。-Operations research linear programming algorithm code, but with C language to solve it. Algorithm to understand the process on their own, and have the best players.
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
dualsimplex
- 对偶单纯形法，用于线性规划的求解-dual simplex methods
Simplex
- 单纯形法C++代码 供大家相互学习交流-Simplex method, C++ code for all to learn from each other
Simplex
- 单纯形法是求解线性规划问题的通用方法。。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 -Simplex method for solving linear programming problems is a common approach. . Due to the limited number of basic feasible solution, so by the limited issue of conversions will be
danchunxing
- 用于求解线性规划问题的单纯形算法，输入为方程个数、变量个数以及系数矩阵，输出为求解结果。-For solving linear programming problem simplex algorithm.
simplex_method
- 自己编写的计算运筹学单纯型法的源代码，用VC++6.0-Computing operations research simplex method of source
simplex
- 优化设计算法：用单纯形法求解目标函数的最优解和最优值，已经验证算法的正确性，在visual c++6.0下开发-Optimization algorithm: the simplex method with the optimal solution of objective function and the optimal value, has verified the correctness of the algorithm in visual c++6.0 under development
Simplex_method
- 单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
simplex
- 用单纯形法中的人工变量法求解线性规划问题，C语言实现-Simplex method of artificial variables for solving linear programming, C language
simplex-method
- 本程序实现单纯形法的一些计算，对单纯形噶进行求值。-Simplex method to achieve this procedure some calculations, simplex Karma evaluated.
Simplex
- C++ Code for Simplex Method
simplex-algorithm
- 应用于电力系统最优运行。C++源码。程序实现了运筹学中的单纯形算法。-This C++ procedure can be used for the optimal operation of the power system. The source code realize the "simplex algorithm" in operational research.