The program for solving integer, netselochisl
- Price in currencies:
- 1.5 $ · 151 RUB · 1.34 €
- Category:
- Mathematics
- Item:
- simplex.zip (224.92 KB)
- Uploaded:
- 25.02.2004 7:24:05
- Sales:
- 36
- Refunds:
- 1
- Customer rating:
- 3.0 of 5 +1 / −1
- Seller:
- andrew´s goods · about the seller and their products
DESCRIPTION
The program for solving integer, netselochisl
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.
REVIEWS
Reviews: (0)
No customer reviews yet.
DISCOUNTS
Discounts:
Discount for regular customers! If the total of your purchases from the seller andrew´s goods exceeds: