Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Marketing Research (Market Survey Inc)

    Uploaded by

    Hockey Lacierda
    This document describes a marketing research problem for a company called Marketsure to determine the optimal allocation of daytime and evening interviews among households with and without children. The objective is to minimize total costs while ensuring at least 400 interviews of each household type and that evening interviews are balanced or exceed day interviews for each group. The problem is formulated as a linear program with constraints on the number of interviews and their timing.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Marketing Research (Market Survey Inc)

    Uploaded by

    Hockey Lacierda
    16 views2 pages
    This document describes a marketing research problem for a company called Marketsure to determine the optimal allocation of daytime and evening interviews among households with and without children. The objective is to minimize total costs while ensuring at least 400 interviews of each household type and that evening interviews are balanced or exceed day interviews for each group. The problem is formulated as a linear program with constraints on the number of interviews and their timing.

    Original Description:

    Management Science subject

    Original Title

    Marketing Research ( Market Survey Inc)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes a marketing research problem for a company called Marketsure to determine the optimal allocation of daytime and evening interviews among households with and without children. The objective is to minimize total costs while ensuring at least 400 interviews of each household type and that evening interviews are balanced or exceed day interviews for each group. The problem is formulated as a linear program with constraints on the number of interviews and their timing.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    16 views2 pages

    Marketing Research (Market Survey Inc)

    Uploaded by

    Hockey Lacierda
    This document describes a marketing research problem for a company called Marketsure to determine the optimal allocation of daytime and evening interviews among households with and without children. The objective is to minimize total costs while ensuring at least 400 interviews of each household type and that evening interviews are balanced or exceed day interviews for each group. The problem is formulated as a linear program with constraints on the number of interviews and their timing.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    MANAGEMENT SCIENCE

    MARKETING RESEARCH
    MARKETSURE (MARKET SURVEY INC)

    DECISION VARIABLES
    DC – the number of daytime interviews of household with children
    EC – the number of evening interviews of household children
    DNC – the number of daytime interviews of household without children
    ENC – the number of evening interviews of household without children

    OBJECTIVE FUNCTION:
    MIN 1,000DC + 1,250EC + 900DNC + 1,000ENC
    s.t.
    DC + EC + DNC + ENC = 1,000 requiring 1,000 total
    interviews
    DC + EC ≥ 400 household with children
    DNC + ENC ≥ 400 household without
    children
    - DC + EC – DNC + ENC ≥ 0 as least as many
    evening interviews as
    day interviews
    -0.4 DC+ 0.6EC ≥ 0 at least 40% of
    interviews of household
    with children during
    evening
    -0.6 DNC + 0.4ENC ≥ 0 at least 60% of
    interviews of household
    without children during
    evening
    DC, NC, DNC, ENC ≥ 0 non-negativity
    constraint

    You might also like