Let us worry about your assignment instead!

We Helped With This R Programming Homework: Have A Similar One?

SOLVED
CategoryProgramming
SubjectR | R Studio
DifficultyGraduate
StatusSolved
More InfoProbability And Statistics Homework Help
184011

Short Assignment Requirements

Model a Linear Program Minimizing Stock based on past purchases and cost including 5 constraints and 2 non-negative values.

Assignment Description

Constraints:

1)      sijt = qijt dijt + sijt-1           iεI, jεj, tε1….. 365  (meets demand by warehouse while leveraging prior stock point)

2)      sijtkijt      iεI, jεJ, tε 1….. 365 (safety stock adherence)

3)      qijt ≥ θijt     iεI, jεJ, tε 1….. 365 (minimum reorder quantity adherence)

4)      1/dijt * sijtγijt       iεI, jεJ, tε 1….. 365 (requires service level to be accounted for)

5)      γi(qijt+sijt) ≤ fjt (addresses physical storage capacity)

6)      q ≥ 0, s ≥ 0,  (non-negativity)

7)      List of Symbols / Nomenclature

8)      The following is a summary of the notation used in modeling this research:

9)      I = All Network Inventory (single SKU)

10)  i = Warehouse Inventory (single SKU)

11)  t = time (may need days as common denominator)

12)  f = storage space in facility

13)  s = stock on hand (by quantity)

14)  sj = stock at month end in warehouse j

15)  c = cost of purchased materials (purchase price per unit)

16)  d = 1 order of market demand quantity

17)  di+n = demand forecast

18)  dj = Total demand at local warehouse j

19)  q = quantity purchased

20)  θ = minimum order quantity

21)  µ = average historic cost

22)  k = Safety Stock

23)  J = All Network Warehouses

24)  j = local warehouse for customer priority, j = 1, 2, …, n

25)  j(λ) = local warehouse assigned to customer λ

26)  γ = Service Level

27)  = “for all instances”

 

Customer Feedback

"Thanks for explanations after the assignment was already completed... Emily is such a nice tutor! "

Order #13073

Find Us On

soc fb soc insta


Paypal supported