1
$\begingroup$

I am looking for MILP modeling code with stochastic/deterministic demand for Inventory ordering policy (e.g. (q,r) or (s,S) policy) with pyomo or gurobi or cplex or GAMS. Any link?

$\endgroup$
3
  • 3
    $\begingroup$ What have you tried already? $\endgroup$
    – Richard
    Aug 4 at 1:11
  • $\begingroup$ Well, I tried with cplex and gurobi but it didn't work for me... $\endgroup$
    – Peter
    Aug 4 at 16:05
  • $\begingroup$ More details on the nature of the model would be helpful. I don't normally associate (Q,R) or (s,S) inventory models with integer programming. $\endgroup$
    – prubin
    Aug 4 at 21:01

2 Answers 2

2
$\begingroup$

One example I know of: https://yetanothermathprogrammingconsultant.blogspot.com/2020/11/optimal-qr-inventory-policy-as-mip.html (and its Pyomo version: https://sysid.github.io/inventory_management/).

$\endgroup$
6
  • $\begingroup$ Thanks Kalv... It's absolutely helpful for me. $\endgroup$
    – Peter
    Aug 4 at 15:33
  • $\begingroup$ Hey Kalv... thank you again for the link. I believe GAMS was used to program the first link. doesn't it? do you know any further link of that program? TIA... $\endgroup$
    – Peter
    Aug 4 at 16:02
  • $\begingroup$ Yes, that was based on a GAMS model. I don't think that was ever made public (it needs probably a bit of clean-up). I was hoping that the math description should be enough to reproduce the results (the math is just a transcribed GAMS model). $\endgroup$ Aug 4 at 18:08
  • $\begingroup$ Yeah! you are absolutely correct!... math description is very clear!. I'm new to GAMS (I use gurobi mostly) so, I wanted to check how the command line interacts with equations. $\endgroup$
    – Peter
    Aug 5 at 1:01
  • $\begingroup$ I don't know what that means, but it should be easy to implement this in Gurobi. $\endgroup$ Aug 5 at 2:16
1
$\begingroup$

You may find some useful ideas in this paper on s,S policies.

IYER, A. V. AND L. SCHRAGE (1992)

ANALYSIS OF THE DETERMINISTIC (s, S) INVENTORY PROBLEM

MANAGEMENT SCIENCE Vol. 38, No. 9,

Part of the abstract is:

The traditional or textbook approach for finding an (s, S) inventory policy is to take a demand distribution as given and then find a reorder point s and order up to point S that are optimal for this demand distribution. In contrast, the deterministic (s, S) inventory problem is to directly determine the (s, S) pair that would have been optimal for the original demand stream, bypassing the distribution fitting step. The deterministic (s, S) inventory problem thus chooses parameters s and S which minimize setup, holding and backorder costs when the corresponding (s, S) policy is implemented over n periods with known demands d1, d2, . . ., d,,. Our contributions are two: (a) a polynomial time algorithm for finding an optimal (s, S) for the deterministic problem, and (b) an empirical comparison of the two approaches. In (b) we compare the long term average costs of the two approaches as a function of the amount of data available, distributional assumptions, and order lead time.

$\endgroup$
1
  • $\begingroup$ Thank you for sharing $\endgroup$
    – Peter
    Aug 5 at 16:55

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.