## A heuristic algorithm for solving mixed-integer programming modelsInstitute of Economic Research, Faculty of Economics, University of Groningen, 1976 - Business & Economics - 34 pages |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

0-l variable algorithm for solving applying the heuristic Be"nichou C.P.A. Bartels change-over coefficient concerning the capacity continuous optimal solution costs due Dutch guilders element of V(I estimated experiences while testing feasible mixed-integer solution feasible rounding fixed equal go to l5 H u V°(y heuristic algorithm increase of costs infeasible integer programming integer solution integer value integer variable iteration steps Linear Programming Mathematical Programming means of production minutes of CPU mixed-integer programming models mixed-integer solution reached MPSX-MIP program MPSX-program Muysken Netherlands non-integer values objective function optimal continuous solution otherwise go paths in G(m planning department production on stock production planning problem reduced costs replan the production restriction concerning rounded feasible second two-periods model set of zero-one shadow prices simple paths six-periods model solution of subproblem solving mixed-integer programming starting solution sub-period Tfc Take H testing the MPSX-MIP tmui UNIVERSITY OF GRONINGEN variable feasible waiting nodes zero-one variables