Location:
Search - danchunxingfa
Search list
Description: 用VB编写的面向对象的单纯形法，可有效解决多维线性规划问题，可以试一试-VB prepared by the object-oriented simplex method, which can effectively solve the multi-dimensional linear programming problem, it can test the
Platform: |
Size: 6787 |
Author: a |
Hits:
Description: 用C++实现的运筹学中的单纯形法问题，请批评指正。-C realized tacticians of the simplex method, please correct me criticism.
Platform: |
Size: 4856 |
Author: muzixi |
Hits:
Description: danchunxingfa biancheng
Platform: |
Size: 2065 |
Author: tju |
Hits:
Description: 单纯型法。用c++编的单纯型法。-simple method. C series with the simple method.
Platform: |
Size: 1333 |
Author: 无忌 |
Hits:
Description: 单纯形法源码
单纯形法源程序 运筹学 单纯形法c语言 单纯形法的c语言程序 单纯形
Platform: |
Size: 4100 |
Author: afsdfa |
Hits:
Description: 单纯形法是一比较典型的线性问题，其有比较规范的求解方式。可以通过c++进行一设计如下。
Platform: |
Size: 1741 |
Author: 狼性无双 |
Hits:
Description: 单纯型法。用c++编的单纯型法。-simple method. C series with the simple method.
Platform: |
Size: 1024 |
Author: 无忌 |
Hits:
Description: 用VB编写的面向对象的单纯形法，可有效解决多维线性规划问题，可以试一试-VB prepared by the object-oriented simplex method, which can effectively solve the multi-dimensional linear programming problem, it can test the
Platform: |
Size: 6144 |
Author: a |
Hits:
Description: 用C++实现的运筹学中的单纯形法问题，请批评指正。-C realized tacticians of the simplex method, please correct me criticism.
Platform: |
Size: 4096 |
Author: |
Hits:
Description: danchunxingfa biancheng
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 单纯形法源码
单纯形法源程序 运筹学 单纯形法c语言 单纯形法的c语言程序 单纯形-Simplex method simplex method source-source operations research simplex method simplex method c language c language program of the simplex
Platform: |
Size: 4096 |
Author: afsdfa |
Hits:
Description: 单纯形法是一比较典型的线性问题，其有比较规范的求解方式。可以通过c++进行一设计如下。-Simplex method is a typical linear problem has a fairly standard way to solve. Can c++ For design are as follows 1.
Platform: |
Size: 1024 |
Author: 狼性无双 |
Hits:
Description: 单纯型法，运筹学中，用C++实现，已经测试过。-Simplex method, operations research, using C++ implementation has been tested.
Platform: |
Size: 26624 |
Author: EvIe Fu |
Hits:
Description: 用单纯型法来计算线性规划问题的c语言程序-With the simplex method to calculate the linear programming problem of c language program
Platform: |
Size: 1024 |
Author: 李仪 |
Hits:
Description: 实现优化中重要算法单纯形法的通用程序，对一般的线性优化问题都可实现计算机直接计算。-An important method to achieve optimal simplex method for general program
Platform: |
Size: 17408 |
Author: 郭润清 |
Hits:
Description: 运筹学基本的单纯形法C语言程序能运行！本人以试！-Basic operations research simplex method C language program to run! I have to try!
Platform: |
Size: 1024 |
Author: lsylsy |
Hits:
Description: 单纯形法用于解决线性规划问题，网上找的，版权归原作者所有
-Simplex method linear programming problem
Platform: |
Size: 39936 |
Author: 李晓凡 |
Hits:
Description: 单纯型法 单纯型法 单纯型法-danchunxingfa
Platform: |
Size: 1024 |
Author: 王小小 |
Hits:
Description: 单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
-Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination.
Platform: |
Size: 1024 |
Author: 马晓敏 |
Hits:
Description: 用单纯形法解线性规划 根据单纯形法的原理，在线性规划问题中，决策变量（控制变量）x1，x2，…x n的值称为一个解,满足所有的约束条件的解称为可行解。使目标函数达到最大值（或最小值）的可行解称为最优解。这样，一个最优解能在整个由约束条件所确定的可行区域内使目标函数达到最大值（或最小值）。求解线性规划问题的目的就是要找出最优解。 -According to the principle of the simplex method, in linear programming problem, the decision variables (control variable) x1, x2,... X n value is called a solution, meet all of the constraint conditions of the solution of the called feasible solution. The objective function to achieve maximum (or minimum) feasible solution of the optimal solution is called. So, an optimal solution by constraint conditions throughout the feasible region determined the objective function to achieve maximum or minimum value). To solve the linear programming problem is to find out the purpose of the optimal solution.
Platform: |
Size: 1024 |
Author: cxx |
Hits: