Simplex LP max Integer
https://www.onlinemathe.de/forum/Vollauslastung-soll-ermittelt-werden
maximize_lp(
24*x3+20*x2+18*x1,[
9*x3+10*x2+4*x1 <= 540,
5*x3+8*x2+6*x1 <= 600,
10*x3+2*x2+8*x1 <= 570
]), numer;
do Branch & Bound as described in the app - add step wise constraints x3=2, x2=27
https://sagecell.sagemath.org/?q=fnbtqj
Branch & Bound addtions
IL20, IL30
results of Simplex-EndTab of Branch
downIL20, downIL30
results alternately round down to integer
downZ20, downZ30
test objective (Z) for best optimization result
Join({{0,0,1,0,0,0,2}},Start)
Join({{0,1,0,0,0,0,27}},A_{21})
add xi to Start-Tab of Branch and execute gauss-step to implement xi value in Tab
no round up test to keep things simpler
sagecell.sagemath.org/?q=ztpddp
| Drei Artikel A1, A2, A3 durchlaufen nacheinander die Produktionstellen Ma1, Ma2, Ma3: Produktionszeiten tmax [min/stück] | Three items A1, A2, A3 pass through the production stations Ma1, Ma2, Ma3 in sequence: Production times tmax [min/item] | |
| Bestimmen Sie das optimale Produktionsprogramm für Vollauslastung ohne Berücksichtigung der Produktionsabfolge. | Determine the optimal production program for full capacity utilization without taking the production sequence into account. |