Product description
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.
Main features
- Content type File
- Content description 224,92 kB
- Updated on the site 25.02.2004
Additional description
Reviews
The program for solving integer, netselochisl
Cumulative discount
| 0,5 $ | the discount is 35% |
| 0,3 $ | the discount is 25% |
| 0,25 $ | the discount is 20% |
| 0,22 $ | the discount is 18% |
| 0,18 $ | the discount is 15% |
| 0,14 $ | the discount is 12% |
| 0,11 $ | the discount is 10% |
| 0,07 $ | the discount is 8% |
| 0,03 $ | the discount is 5% |
Amount of purchases from the seller: $
Your discount: %
Cumulative discount
| 0,5 $ | the discount is 35% |
| 0,3 $ | the discount is 25% |
| 0,25 $ | the discount is 20% |
| 0,22 $ | the discount is 18% |
| 0,18 $ | the discount is 15% |
| 0,14 $ | the discount is 12% |
| 0,11 $ | the discount is 10% |
| 0,07 $ | the discount is 8% |
| 0,03 $ | the discount is 5% |
Amount of purchases from the seller: $
Your discount: %
You viewed
All images, logos, and names of games, programs, and other products used are taken from public sources and are for informational purposes only. All trademarks, logos, names, and other intellectual property belong to their respective owners. Use of such images on the website does not imply any affiliation or connection with the copyright holders.