Pythonで学ぶOptimization入門
Jasmin Ludolf
Content Developer
需要:
ドレス生産:


$C$: 生地費 + Mr. S 賃金 + Mr. T 機会費用
機会費用: 縫製を選ぶことで他の業務を捨てるコスト
$C=110g+240g+105g+75t+160t+35t$
$C=455g+270t$
| 費用 | 生地 | Mr. S | Ms. T |
|---|---|---|---|
| ドレス | $\$110$ | $\$40/h \times 6h = \$240$ | $\$35/h \times 3h = \$105$ |
| タキシード | $\$75$ | $\$40/h \times 4h = \$160$ | $\$35/h \times 1h = \$35$ |
制約:
需要: $g\leq20$, $t\leq12$
資源: $6g+4t\leq40$, $3g+t\leq20$
from scipy.optimize import milp, Bounds, LinearConstraintresult = milp([-545, -330],integrality=[1, 1],bounds=Bounds([0, 0], [20, 12]),constraints=LinearConstraint([[6, 4], [3, 1]], ub=[40, 20]))
print(result.message)
print(f'The optimal number of gowns produced is: {result.x[0]:.2f}')
print(f'The optimal number of tuxedos produced is: {result.x[1]:.2f}')
Optimization terminated successfully. (HiGHS Status 7: Optimal)
The optimal number of gowns produced is: 6.00
The optimal number of tuxedos produced is: 1.00
result = milp([-545, -330],
bounds=Bounds([0, 0], [20, 12]),
constraints=LinearConstraint([[6, 4], [3, 1]], ub=[40, 20]))
...
The optimal number of gowns produced is: 6.67
The optimal number of tuxedos produced is: 0.00
提案解: ドレス6.67着、タキシード0.00着 $\rightarrow$
四捨五入: 7着と0着
切り捨て: 6着と0着
Pythonで学ぶOptimization入門