Description: 线性规划工具箱-performing the standard
two phase simplex method on linear programming problems.具体介绍里面有-Linear Programming Kit-performing the standardtwo phase simplex method on linear programming problems. Specific introduction there Platform: |
Size: 12288 |
Author:邹平 |
Hits:
Description: 利用单纯形法求解线性规划，输入为标准型的线性规划，求解得到最优解和最优值-Use simplex method to solve linear programming, enter as the standard type of linear programming, for solving the optimal solution and optimal value Platform: |
Size: 1024 |
Author:nano |
Hits:
Description: 学会MATLAB编程；
学会用单纯型法求解线性规划；
学会用对偶单纯型法求解线性规划；-Institute of MATLAB programming learn how to use simple method to solve linear programming learn how to use dual simplex method to solve linear programming Platform: |
Size: 1024 |
Author:mengxiang |
Hits:
Description: This a program for method simplex of optimization.-This is a program for method simplex of optimization. Platform: |
Size: 6144 |
Author:Eloy |
Hits:
Description: 单纯形法，可以用于进行线性规划解的求取。在数学上有一定的应用价值，但速度上可能不太优化，如果对速度有要求的，可参考MATLAB-Simplex method, linear programming solution can be used to carry out the strike. In mathematics there is a certain value, but the speed may not be optimized for speed if required, can refer to MATLAB Platform: |
Size: 48128 |
Author:fossilxiang |
Hits:
Description: 原始单纯形法（大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 original simplex method (big M method, without giving the initial basic variable) Programmed by Liyang (faruto' s Studio ~!) BNU MATH Email: liyangbnu@mail.bnu.edu.cn QQ: 516667408 last modified 2008.4.27 solving standard linear programming: max C* X st A* X = b (b> = 0) X> = 0 input: C is the n-dimensional row vector, A is the coefficient matrix of m* n, b is the m-dimensional column vector Platform: |
Size: 1024 |
Author:hongye |
Hits:
Description: 一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。
从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems.
Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.) Platform: |
Size: 6144 |
Author:刘善武 |
Hits:
Search - simplex method by matlab