solve the single-item lot-sizing problem. More...
Go to the source code of this file.
Functions | |
def | sils (T, f, c, d, h) |
def | sils_cut (T, f, c, d, h, conshdlr) |
def | mk_example () |
Variables | |
T | |
f | |
c | |
d | |
h | |
model = sils(T,f,c,d,h) | |
y | |
x | |
I | |
conshdlr = Conshdlr_sils() | |
solve the single-item lot-sizing problem.
Definition in file lotsizing_lazy.py.
def lotsizing_lazy.mk_example | ( | ) |
mk_example: book example for the single item lot sizing
Definition at line 130 of file lotsizing_lazy.py.
def lotsizing_lazy.sils | ( | T, | |
f, | |||
c, | |||
d, | |||
h | |||
) |
sils -- LP lotsizing for the single item lot sizing problem Parameters: - T: number of periods - P: set of products - f[t]: set-up costs (on period t) - c[t]: variable costs - d[t]: demand values - h[t]: holding costs Returns a model, ready to be solved.
Definition at line 57 of file lotsizing_lazy.py.
def lotsizing_lazy.sils_cut | ( | T, | |
f, | |||
c, | |||
d, | |||
h, | |||
conshdlr | |||
) |
solve_sils -- solve the lot sizing problem with cutting planes - start with a relaxed model - used lazy constraints to elimitate fractional setup variables with cutting planes Parameters: - T: number of periods - P: set of products - f[t]: set-up costs (on period t) - c[t]: variable costs - d[t]: demand values - h[t]: holding costs Returns the final model solved, with all necessary cuts added.
Definition at line 89 of file lotsizing_lazy.py.