Analitik Rantai Pasok dengan Python
Aaren Stubberfield
Supply Chain Analytics Mgr.
PuLP adalah kerangka pemodelan untuk masalah Linear (LP) dan Integer Programming (IP) dalam Python
Dikelola oleh COIN-OR Foundation (Computational Infrastructure for Operations Research)
PuLP terhubung ke Solver
CPLEXCOINGurobi| Kue A | Kue B | |
|---|---|---|
| Oven | 0,5 hari | 1 hari |
| Pembuat | 1 hari | 2,5 hari |
| Pengemas | 1 hari | 2 hari |
.
| Kue A | Kue B | |
|---|---|---|
| Laba | $20,00 | $40,00 |
LpProblem(name='NoName', sense=LpMinimize)
name = Nama masalah untuk keluaran file .lp, mis. "My LP Problem"sense = Maksimalkan atau minimalkan fungsi objektifLpMinimize (default)LpMaximizefrom pulp import *
# Initialize Class
model = LpProblem("Maximize Bakery Profits", LpMaximize)
LpVariable(name, lowBound=None, upBound=None, cat='Continuous', e=None)
name = Nama variabel untuk keluaran file .lplowBound = Batas bawahupBound = Batas atascat = Jenis variabele = Untuk pemodelan berbasis kolom# Define Decision Variables
A = LpVariable('A', lowBound=0, cat='Integer')
B = LpVariable('B', lowBound=0, cat='Integer')
# Define Objective Function
model += 20 * A + 40 * B
# Define Constraints
model += 0.5 * A + 1 * B <= 30
model += 1 * A + 2.5 * B <= 60
model += 1 * A + 2 * B <= 22
# Solve Model
model.solve()
print("Produce {} Cake A".format(A.varValue))
print("Produce {} Cake B".format(B.varValue))
from pulp import *
# Initialize Class
model = LpProblem("Maximize Bakery Profits",
LpMaximize)
# Define Decision Variables
A = LpVariable('A', lowBound=0,
cat='Integer')
B = LpVariable('B', lowBound=0,
cat='Integer')
# Define Objective Function
model += 20 * A + 40 * B
# Define Constraints
model += 0.5 * A + 1 * B <= 30
model += 1 * A + 2.5 * B <= 60
model += 1 * A + 2 * B <= 22
# Solve Model
model.solve()
print("Produce {} Cake A".format(A.varValue))
print("Produce {} Cake B".format(B.varValue))
Meninjau 5 langkah proses pemodelan PuLP
Menyelesaikan contoh Penjadwalan Sumber Daya
Analitik Rantai Pasok dengan Python