Scribd Logo
Upload

Welcome to Scribd!

  • Ex Grila Rez

    Uploaded by

    Tibi
    22 views3 pages
    This document contains examples of probability distribution problems and inventory management optimization problems. Some key points: 1. Example 1 finds the optimal stocking level (s=8) that maximizes probability of meeting demand based on a given probability distribution of demand. 2. Example 2 calculates the total costs of stocking and determines the optimal stocking level (s=25) that minimizes these costs. 3. Example 8 determines the optimal stocking level (s=6) that maximizes probability of meeting demand, where the probability distribution is based on the frequency of different demand amounts. 4. Examples discuss optimizing inventory policies to minimize costs based on factors like stocking costs, ordering costs, demand

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains examples of probability distribution problems and inventory management optimization problems. Some key points: 1. Example 1 finds the optimal stocking level (s=8) that maximizes probability of meeting demand based on a given probability distribution of demand. 2. Example 2 calculates the total costs of stocking and determines the optimal stocking level (s=25) that minimizes these costs. 3. Example 8 determines the optimal stocking level (s=6) that maximizes probability of meeting demand, where the probability distribution is based on the frequency of different demand amounts. 4. Examples discuss optimizing inventory policies to minimize costs based on factors like stocking costs, ordering costs, demand

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    22 views3 pages

    Ex Grila Rez

    Uploaded by

    Tibi
    This document contains examples of probability distribution problems and inventory management optimization problems. Some key points: 1. Example 1 finds the optimal stocking level (s=8) that maximizes probability of meeting demand based on a given probability distribution of demand. 2. Example 2 calculates the total costs of stocking and determines the optimal stocking level (s=25) that minimizes these costs. 3. Example 8 determines the optimal stocking level (s=6) that maximizes probability of meeting demand, where the probability distribution is based on the frequency of different demand amounts. 4. Examples discuss optimizing inventory policies to minimize costs based on factors like stocking costs, ordering costs, demand

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    EXERCITII GRILA

    1.
    Cant 5 6 7 8 9 10
    P(x) 0.15 0.21 0.18 0.16 0.13 0.17
    L(s)= P(x) 0.15 0.36 0.54 0.7 0.83 1

    Cs=35 Cp=65 =Cp/(Cs+Cp) =65/100=0.65


    0.15 <0.65 0.35<0.65 ….. 0.7 >0.65 L(8)> => s=8 -stoc optim

    2.
    Cant 7 12 14 18 25 31
    P(x) 0.15 0.21 0.18 0.16 0.13 0.17
    L(s)=∑P(x) 0.15 0.36 0.54 0.7 0.83 1

    C=Cs* *P(x) + Cp * *P(x) cheltuieli totale stocare


    s=25 C=35[(25-7)*0.15 +(25-12)*0.21 +(25-14)*0.18 +(25-18)*0.16] +65 *[(31-25)*0.17]=
    C=298,55+168,3=466,85

    8.

    F(x)=4+3+…+5+2=32
    P(x) 0.125 0.09375 0.15625 0.09375 0.1875 0.125 0.15625 0.0625
    L(s)=∑P(x) 0.125 0.21675 0.373 0.4667 0.65425 0.77925 0.9355 0.998
    P(x1)=F(x1)/F(x)=4/32=0.125 P(x2)=F(x2)/F(x)=3/32=0.09375
    =147/210=0.7 0.125<0.7 …. 0.77>0.7 => s=6 (rasp pt ex. 10)
    C=63*[(6-1)*0.125 +(6-2)* 0.093+ (6-3)*0.0156+( 6-4)*0.093 +(6-5)*0.1875] + 147*[(7-6)*0.15625
    +(8-6)*0.0625]= 116.12475+41.34375= 157.4
    Ex 9-12 se rez asemanator
    13.
    Nr. crt. 1 2 3 4 5 6 7 8 9 10
    Cant. Solicitata 11 10 12 11 13 10 11 12 13 12

    cant 10 11 12 13
    P(x) 0,2 0,3 0.3 0.2
    L(s)=∑P(x) 0.2 0.5 0.8 1

    =206/320=0.64 0.2<0.64 0.5 <0.64 0.8>0.64 => s=12


    P(x) in acest caz este nr de cate ori apare cantitatea in acest tabel /100. Ex 14-16 se rez la fel
    17.
    λ = Numarul de sosiri ρ= λ / µ P0=1-ρ n= *
    µ = Numarul de serviri n = ρ / 1-ρ ρ=2/5 ex 18,19 la fel
    20. la fel pt 22-24, 26
    ρ=2/5
    = * = =

    25.
    = = =( ) *3= P0=1-2/3=1/3 ρ=2/3

    21.
    N=4
    = = ( 1- ) * = * = * =

    =( )* = =

    31.

    38.
    Cerere totala Q 1800
    Perioada timp t 182
    Cost stocare Cs 220
    Cost intrare= c.penalizare Ci= 700
    Cp
    Cu posibilitate lipsei de stoc
    factor de penalizare =700/920= 0.7608
    =cp/(cp+cs)
    volum optim comanda q
    q=sqrt((2*Q*ci)/(t*cs*p) q= = = 8.307
    stoc optim s
    s=q*p
    numar de aprovizionari v v= Q/q= 1500/8.307= 180.7= 181
    v=Q/q
    perioada optima T
    T=t/v
    gestiunea optima C
    C=sqrt(2*Q*t*cs*p)

    48.
    Fara lipsa de stoc
    factor de penalizare =400/415= 0.9638
    =cp/(cp+cs)
    volum optim comanda q
    q=sqrt((2*Q*ci)/(t*cs) q= = =29. 81
    stoc optim s
    s=q*p
    numar de aprovizionari v v= Q/q= 1500/29.81= 50.31
    v=Q/q
    perioada optima T T=t/v=90/50.31= 1.8= 2
    T=t/v
    gestiunea optima C
    C=sqrt(2*Q*t*cs)

    You might also like