Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Group 6

    Uploaded by

    Arpit Shah
    The document presents a quantitative techniques marketing assignment on allocating salesmen to departments to minimize costs. It describes an assignment problem where the optimal solution is to assign 1 salesman to department B, 2 salesmen to department D, 3 salesmen to department E, 4 salesmen to department A, and 5 salesmen to department C, resulting in a total minimum cost of 21. It then discusses using a transportation problem to determine the optimal allocation of products from multiple factories to various retail shops to minimize transportation costs. The optimal solution allocates specific units from each factory to different retail shops, with a total minimum transportation cost of 530. Finally, it formulates a linear programming problem to maximize profit from advertising in rural and urban markets with

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd

    Group 6

    Uploaded by

    Arpit Shah
    12 views26 pages
    The document presents a quantitative techniques marketing assignment on allocating salesmen to departments to minimize costs. It describes an assignment problem where the optimal solution is to assign 1 salesman to department B, 2 salesmen to department D, 3 salesmen to department E, 4 salesmen to department A, and 5 salesmen to department C, resulting in a total minimum cost of 21. It then discusses using a transportation problem to determine the optimal allocation of products from multiple factories to various retail shops to minimize transportation costs. The optimal solution allocates specific units from each factory to different retail shops, with a total minimum transportation cost of 530. Finally, it formulates a linear programming problem to maximize profit from advertising in rural and urban markets with

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document presents a quantitative techniques marketing assignment on allocating salesmen to departments to minimize costs. It describes an assignment problem where the optimal solution is to assign 1 salesman to department B, 2 salesmen to department D, 3 salesmen to department E, 4 salesmen to department A, and 5 salesmen to department C, resulting in a total minimum cost of 21. It then discusses using a transportation problem to determine the optimal allocation of products from multiple factories to various retail shops to minimize transportation costs. The optimal solution allocates specific units from each factory to different retail shops, with a total minimum transportation cost of 530. Finally, it formulates a linear programming problem to maximize profit from advertising in rural and urban markets with

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    12 views26 pages

    Group 6

    Uploaded by

    Arpit Shah
    The document presents a quantitative techniques marketing assignment on allocating salesmen to departments to minimize costs. It describes an assignment problem where the optimal solution is to assign 1 salesman to department B, 2 salesmen to department D, 3 salesmen to department E, 4 salesmen to department A, and 5 salesmen to department C, resulting in a total minimum cost of 21. It then discusses using a transportation problem to determine the optimal allocation of products from multiple factories to various retail shops to minimize transportation costs. The optimal solution allocates specific units from each factory to different retail shops, with a total minimum transportation cost of 530. Finally, it formulates a linear programming problem to maximize profit from advertising in rural and urban markets with

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 26

    QTM

    in
    MARKETING
    PRESENTED BY:
    1. NUPEN GANDHI (18)
    2. DIPTI GOEL (19)
    3. SHIKHA JAIN (22)
    4. APPAL JOGATAR (23)
    5. DISHA KOTHARI (29)
    6. VRUTIKA KOTHARI (30)
    7. HARDIK SAMPAT (48)
    8. ARPIT SHAH (52)
    9. CHINTAN VYAS (58)
    10.RUCHIKA VYAS (59)
    INTRODUCTION
     Marketing was one of the last of the major
    functional areas of management activity to be
    entered by quantitative methods and techniques in
    a systematic way.
     There are several ways in which quantitative
    methods can be used in marketing.
    INTRODUCTION - cont
     In selecting an appropriate method of analysis, two
    major factors should be taken into consideration:

    • First, whether the variables analysed are dependent or


    interdependent

    • Second, whether the input data are of a metric or non-


    metric form.

     Marketing variables are usually interdependent.


    Factors for the lag of QTM in Marketing

     The complexity of marketing phenomena.

     Interaction effects of marketing variables.

     Measurement problems in marketing.

     Instability of marketing relationships.


    Quantitative Techniques
    Multivariable methods

    Regression, correlation and forecasting Techniques

    Simulation methods

    Fuzzy sets

    Artificial intelligence

    Statistical decision theory or stochastic methods

    Deterministic operational research methods


    CASE STUDY
    ON
    COCA COLA
    Marketing

    Advertisemen
    Salesmen Distribution
    t
    ASSIGNMENT PROBLEM :

     Assignment problems involve determining


    most efficient assignment

     The desired objective is to minimize total


    cost or time required to perform the task

     The assignment is made on ONE to ONE basis


    Allocation of salesmen to
    minimize the cost- Assignment
    Problem

    DEPARTMENTS
    WORKERS A B C D E
    1 10 3 3 2 8
    2 9 7 8 2 7
    3 7 5 6 2 4
    4 3 5 8 2 4
    5 9 10 9 6 10
    ROW MINIMISATION
    DEPARTMENTS
    WORKERS A B C D E
    1 8 1 1 0 6
    2 7 5 6 0 5
    3 5 3 4 0 2
    4 1 3 6 0 2
    5 3 4 3 0 4
    COLUMN MINIMISATION

    DEPARTMENTS
    WORKERS A B C D E
    1 7 0 0 0 4
    2 6 4 5 0 3
    3 4 2 3 0 0
    4 0 2 5 0 0
    5 2 3 2 0 2
    ALLOCATION OF ZERO’S
    DEPARTMENTS
    WORKERS A B C D E
    0
    1 7 0 0 0 4
    0
    2 6 4 5 0 3
    0
    3 4
    0 2 3 0 0
    4 0 2 5 0 0
    5 2 3 2 0 2
    CONTD..
    DEPARTMENTS
    WORKERS A B C D E
    0
    1 9 0 0 2 6
    0
    2 6 2 3 0 3
    0
    3 4
    0 0 1 0 0
    4 0 0 30 0 0
    5 2 1 0 0 2
    DEPARTMENTS
    WORKERS A B C D E
    0
    1 9 0 0 2 6
    0
    2 6 2 3 0 3
    0
    3 4
    0 0 1 0 0
    4 0 0 30 0 0
    5 2 1 0 0 2
    OPTIMAL SOLUTION :-
    1 B
    2 D
    3 E
    4 A
    5 C
    1B + 2D + 3E + 4A + 5C
    3+2+4+3+9

    The total minimum cost = 21


    Transportation Problem
     To transport a single commodity from several
    sources to different destinations

     All relationships are assumed to be linear

     Objective is to determine the optimum


    allocation
    Distribution to various retail
    shops – Transportation
    Problem
    RETAIL SHOP
    FACTORY 1 2 3 4 Supply
    1 10 2 20 11 20
    2 12 7 9 20 25
    3 4 14 16 18 10
    Demand 5 15 15 20 55
    Matrix Minimum

    RETAIL SHOP
    FACTORY 1 2 3 4 Supply
    15 5
    1 10 2 20 11 20
    15 10
    2 12 5 7 9 20 5 25
    3 4 14 16 18 10
    Demand 5 15 15 20 55
    UNITS ALLOCATION COST

    2 15 30

    11 5 55

    9 15 135

    20 10 200

    4 5 20

    18 5 90

    TOTAL COST 530


    Linear Programming Problem(LPP)

     The mathematical models which tells to optimise


    (minimize or maximise) the objective function Z
    subject to certain condition on the variables is
    called a Linear programming problem (LPP).

     The linear programming technique helps to make


    the best possible use of available productive
    resources (such as time, labour, machines etc.)
    Advertisement in Rural and Urban - LPP Model

    MARKET MEDIA MAXIMUM


    TV PRESS EXPENSE
    (IN RS./YEAR)

    RURAL 2 1 20
    URBAN 5 2 50
    PROFIT 50 30
    Maximization z=50x+30y

    Subject to :
    2x+1y≦20
    5x+2y≦50

    Solution,
    2x+1y=20 5x+2y=50
    X 0, 10 X 10, 0
    Y 20, 0 Y 0, 25
    Graphical Solution to LP Problem
    y
    Scale: 2units=5cm

    x
    END POINTS: P(0,20),Q(10,0),R(0,0).

    Z=50X+30Y
    P(0,20)= 50(0)+30(20) =600
    Q(10,0) = 50(10)+30(0) =500
    R(0,0) = 50(0)+30(0) =0

    600 is the maximum profit in the feasible area.

    You might also like