- Category:
- Algorithm
- Tags:
-
- File Size:
- 6kb
- Update:
- 2018-03-27
- Downloads:
- 1 Times
- Uploaded by:
- 刘善武
Description: 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.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| Simplex_Method.m | 252 | 2016-11-18
|
| column_generation.m | 509 | 2016-11-03
|
| simplexTab.m | 3320 | 2016-11-18
|
| 单纯形Matlab代码（成功版） | 0 | 2017-07-21
|
| 单纯形Matlab代码（成功版）\interChange1.m | 232 | 2016-11-19
|
| 单纯形Matlab代码（成功版）\multMat.m | 268 | 2016-11-18
|
| 单纯形Matlab代码（成功版）\multiFromRowToRow.m | 262 | 2016-11-18
|
| 单纯形Matlab代码（成功版）\pivot.m | 404 | 2016-11-18
|
| 单纯形Matlab代码（成功版）\simplexTab1.m | 2718 | 2016-11-19
|
| 单纯形法.java | 4560 | 2016-11-18 |
Download