- Cell Phones 1585
- Desktop 759
- Editors 430
- Education, Science & Engineering 1094
- Architecture & Building 60
- CAD 50
- Education Programs 134
- Encyclopedias & Dictionaries 53
- Mathematics 94
- Medicine 28
- Nautics 16
- Scientific-&-Engineering Programs 98
- Tests 140
- Translators 4
- Others 417
- Games 2253
- Internet 4712
- Multimedia & Graphics 994
- Office software 759
- PC 455
- Programming 1897
- Security 988
- SEO 302
- Software for Pocket PC 160
- Utilities 3883
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.