Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    OR Assignment PRM 43

    Uploaded by

    Ankit kumar
    This document contains 4 questions for an Operations Research assignment. Question 1 does not provide any details. Question 2 presents a linear programming problem involving minimizing the cost of television advertisements across different shows to reach exposure requirements for different demographic groups. Question 3 involves assigning jobs to machines to minimize total completion time. Question 4 presents an integer programming problem to select investments from a list that maximizes total net present value while staying within a $15 million budget.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    OR Assignment PRM 43

    Uploaded by

    Ankit kumar
    32 views2 pages
    This document contains 4 questions for an Operations Research assignment. Question 1 does not provide any details. Question 2 presents a linear programming problem involving minimizing the cost of television advertisements across different shows to reach exposure requirements for different demographic groups. Question 3 involves assigning jobs to machines to minimize total completion time. Question 4 presents an integer programming problem to select investments from a list that maximizes total net present value while staying within a $15 million budget.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 4 questions for an Operations Research assignment. Question 1 does not provide any details. Question 2 presents a linear programming problem involving minimizing the cost of television advertisements across different shows to reach exposure requirements for different demographic groups. Question 3 involves assigning jobs to machines to minimize total completion time. Question 4 presents an integer programming problem to select investments from a list that maximizes total net present value while staying within a $15 million budget.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    32 views2 pages

    OR Assignment PRM 43

    Uploaded by

    Ankit kumar
    This document contains 4 questions for an Operations Research assignment. Question 1 does not provide any details. Question 2 presents a linear programming problem involving minimizing the cost of television advertisements across different shows to reach exposure requirements for different demographic groups. Question 3 involves assigning jobs to machines to minimize total completion time. Question 4 presents an integer programming problem to select investments from a list that maximizes total net present value while staying within a $15 million budget.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    Operations Research (Assignment)

    Submission Date: 7th March 2023


    Note: Each Question carries 15 marks.
    Q 1)

    Q 2) LPP
    The General Flakes Company sells a brand of low-fat breakfast cereal that appeals to people
    of all age groups and both genders. The company advertises this cereal in a variety of 30-
    second television ads, and these ads can be placed in a variety of television shows. The ads
    in different shows vary by cost—some 30-second slots are much more expensive than
    others—and by the types of viewers they are likely to reach. The company has segmented
    the potential viewers into six mutually exclusive categories: males age 18 to 35; males age
    36 to 55; males over 55; females age 18 to 35; females age 36 to 55; and females over 55. A
    rating service can supply data on the numbers of viewers in each of these categories who
    will watch a 30-second ad on any particular television show. Each such viewer is called an
    exposure. The company has determined the required number of exposures it wants to
    obtain for each group. It wants to know how many ads to place on each of several television
    shows to obtain these required exposures at minimum cost. The data on costs per ad,
    numbers of exposures per ad, and minimal required exposures are listed in Table, where
    numbers of exposures are expressed in millions, and costs are in thousands of dollars.

    What should the company do?


    Objective: To develop an LP spreadsheet model that relates the numbers of ads on various
    television shows to the exposures to various viewer groups, and to use Solver to find the
    minimum-cost advertising strategy that meets minimum exposure constraints.

    Q 3) Assignment Model
    There are four jobs and five machines. Every pairing of a machine and a job has a given job
    completion time. The problem is to assign the machines to the jobs so that the total time to
    complete all jobs is minimized.

    Q 4)
    The Tatham Company is considering seven investments. The cash required for each
    investment and the net present value (NPV) each investment adds to the firm are listed in
    Table. Each NPV is based on a stream of future revenues, and it includes the cash
    requirement, which is incurred right away. The table also lists the return of investment (ROI)
    for each investment, defined as the ratio of NPV to cash required, minus 1. The budget for
    investment is $15 million. Tatham wants to find the investment policy that maximizes its
    total NPV. The crucial assumption here is that if Tatham wants to take part in any of these
    investments, it must go all the way. It cannot, for example, go halfway in investment 1 by
    investing $2.5 million and realizing an NPV of $2.8 million. In fact, if partial investments
    were allowed, you wouldn’t need IP; you could use LP.

    Objective To use binary IP to find the set of investments that stays within budget and
    maximizes total NPV.

    You might also like