Analitik Rantai Pasok dengan Python
Aaren Stubberfield
Supply Chain Analytics Mgr.
Berat maksimum 20.000 lb
| Produk | Berat (lb) | Profit ($AS) |
|---|---|---|
| A | 12.800 | 77.878 |
| B | 10.900 | 82.713 |
| C | 11.400 | 82.728 |
| D | 2.100 | 68.423 |
| E | 11.300 | 84.119 |
| F | 2.300 | 77.765 |
prod = ['A', 'B', 'C', 'D', 'E', 'F'] weight = {'A':12800, 'B':10900, 'C':11400, 'D':2100, 'E':11300, 'F':2300} prof = {'A':77878, 'B':82713, 'C':82728, 'D':68423, 'E':84119, 'F':77765}# Initialize Class model = LpProblem("Loading Truck Problem", LpMaximize) # Define Decision Variables x = LpVariable.dicts('ship_', prod, cat='Binary')# Define Objective model += lpSum([prof[i]*x[i] for i in prod]) # Define Constraint model += lpSum([weight[i]*x[i] for i in prod]) <= 20000# Solve Model model.solve() for i in prod: print("{} status {}".format(i, x[i].varValue))
Berat maksimum 20.000 lb
| Produk | Kirim atau Tidak |
|---|---|
| A | Tidak |
| B | Tidak |
| C | Tidak |
| D | Ya |
| E | Ya |
| F | Ya |
Hasil
Salah satu produk E atau D dipilih, tetapi tidak keduanya.
model += x['E'] + x['D'] <= 1
prod = ['A', 'B', 'C', 'D', 'E', 'F']
weight = {'A':12800, 'B':10900, 'C':11400,
'D':2100, 'E':11300, 'F':2300}
prof = {'A':77878, 'B':82713, 'C':82728,
'D':68423, 'E':84119, 'F':77765}
# Initialize Class
model = LpProblem("Loading Truck Problem",
LpMaximize)
# Define Decision Variables
x = LpVariable.dicts('ship_', prod,
cat='Binary')
# Define Objective
model += lpSum([prof[i]*x[i] for i in prod])
# Define Constraint
model +=
lpSum([weight[i]*x[i] for i in prod]) <= 20000
model += x['E'] + x['D'] <= 1
# Solve Model
model.solve()
for i in prod:
print("{} status {}".format(i, x[i].varValue))
Berat maksimum 20.000 lb
| Produk | Kirim atau Tidak |
|---|---|
| A | Tidak |
| B | Tidak |
| C | Ya |
| D | Ya |
| E | Tidak |
| F | Ya |
Hasil
Jika produk D dipilih maka produk B juga harus dipilih.
model += x['D'] <= x['B']prod = ['A', 'B', 'C', 'D', 'E', 'F'] weight = {'A':12800, 'B':10900, 'C':11400, 'D':2100, 'E':11300, 'F':2300} prof = {'A':77878, 'B':82713, 'C':82728, 'D':68423, 'E':84119, 'F':77765} # Initialize Class model = LpProblem("Loading Truck Problem", LpMaximize) # Define Decision Variables x = LpVariable.dicts('ship_', prod, cat='Binary')
# Define Objective
model += lpSum([prof[i]*x[i] for i in prod])
# Define Constraint
model +=
lpSum([weight[i]*x[i] for i in prod]) <= 20000
model += x['D'] <= x['B']
# Solve Model
model.solve()
for i in prod:
print("{} status {}".format(i, x[i].varValue))
Berat maksimum 20.000 lb
| Produk | Kirim atau Tidak |
|---|---|
| A | Tidak |
| B | Ya |
| C | Tidak |
| D | Ya |
| E | Tidak |
| F | Ya |
Hasil
| Kendala logis | Kendala |
|---|---|
| Jika item _i_ dipilih, maka item _j_ juga dipilih. | x$_{i}$ - x$_{j}$ ≤ 0 |
| Salah satu item _i_ atau _j_ dipilih, tetapi tidak keduanya. | x$_{i}$ + x$_{j}$ = 1 |
| Jika item _i_ dipilih, maka item _j_ tidak dipilih. | x$_{i}$ - x$_{j}$ ≤ 1 |
| Jika item _i_ tidak dipilih, maka item _j_ tidak dipilih. | -x$_{i}$ + x$_{j}$ ≤ 0 |
| Paling banyak satu dari item _i_, _j_, dan _k_ dipilih. | x$_{i}$ + x$_{j}$ + x$_{k}$ ≤ 1 |
Analitik Rantai Pasok dengan Python