- Cell Phones 614
- Editors 270
- Education, Science & Engineering 330
- Architecture & Building 26
- CAD 58
- Education Programs 44
- Encyclopedias & Dictionaries 19
- Mathematics 16
- Medicine 15
- Nautics 3
- Scientific-&-Engineering Programs 17
- Tests 70
- Translators 10
- Others 52
- Games 2714
- Internet 595
- Mobile Software 5
- Multimedia & Graphics 1262
- PC 424
- Programming 367
- Security 1605
- SEO 78
- Utilities 914
The program for solving integer, netselochisl
Refunds: 1
Uploaded: 25.02.2004
Content: simplex.zip 224,92 kB
| 0,5 $ | the discount is | 35% |
| show all discounts | ||
| 0,03 $ | the discount is | 5% |
Product description
The program is designed to solve the problems of integer, mixed-integer and noninteger programming.
The program provides the following methods:
1. M-Method
2. The two-stage method
3. The dual simplex method
4. The method of branches and borders
5. The method of clipping Gomory
M-method, a two-step method and dual simplex method designed to solve linear programming problems. In addressing the dual simplex method analyzes an optimal solution for sensitivity.
Branch and bound method and the method of clipping Gomory allow to solve completely integer and mixed-integer linear problems. When you receive the optimal solution analyzes the status of resources.
Additional information
Do not forget to take into account the initial data "-" sign. And that will give not quite clear data.
Feedback
1 1| Period | |||
| 1 month | 3 months | 12 months | |
| 0 | 0 | 0 | |
| 0 | 0 | 0 | |