The program for solving integer, netselochisl

Affiliates: 0,15 $how to earn
Pay with:
i agree with "Terms for Customers"
Sold: 36 last one 12.03.2014
Refunds: 1

Uploaded: 25.02.2004
Content: 224,92 kB
Loyalty discount! If the total amount of your purchases from the seller andrew's goods more than:
0,5 $the discount is35%
show all discounts
0,03 $the discount is5%
If you want to know your discount rate, please provide your email:

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.


No feedback yet.
In order to counter copyright infringement and property rights, we ask you to immediately inform us at the fact of such violations and to provide us with reliable information confirming your copyrights or rights of ownership. Email must contain your contact information (name, phone number, etc.)