Problem

Linear Programming (Appendix)Meals for Professionals, Inc. offers monthly service plans pr...

Linear Programming (Appendix)

Meals for Professionals, Inc. offers monthly service plans providing prepared meals that are delivered to the customers’ homes. The target market for these meal plans includes double-income families with no children and retired couples in upper income brackets. The firm offers two monthly plans: Premier Cuisine and Haute Cuisine. The Premier Cuisine plan provides frozen meals that are delivered twice each month: this plan generates a contribution margin of $120 for each monthly plan sold. The Haute Cuisine plan provides freshly prepared meals delivered on a daily basis and generates a contribution margin of $90 for each monthly plan sold. The company’s reputation provides a market that will purchase all the meals that can be prepared. All meals go through food preparation and cooking steps in the company’s kitchens. After these steps, the Premier Cuisine meals arc flash frozen. The time requirements per monthly meal plan and hours available per month are as follows:

 

Preparation

Cooking

Freezing

Hours required:

 

 

 

   Premier Cuisine

  2

  2

  1

   Haute Cuisine

  1

  3

  0

Hours available

60

120

45

For planning purposes, Meals for Professionals, Inc. uses linear programming to determine the most profitable number of Premier Cuisine and Haute Cuisine monthly meal plans to produce.

Required:

1. Using the notation P for Premier Cuisine and H for Haute Cuisine, state the objective function and the constraints that management should use to maximize the total contribution margin generated by the monthly meal plans.

2. Graph the constraints on the meal preparation process. Be sure to clearly label the graph.

3. Using the graph prepared in requirement (2), determine the optimal solution to the company’s production planning problem in terms of the number of each type of meal plan to produce.

4. Calculate the value of the objective function at the optimal solution.

5. If the constraint on preparation time could be eliminated, determine the revised optimal solution.

Step-by-Step Solution

Request Professional Solution

Request Solution!

We need at least 10 more requests to produce the solution.

0 / 10 have requested this problem solution

The more requests, the faster the answer.

Request! (Login Required)


All students who have requested the solution will be notified once they are available.
Add your Solution
Textbook Solutions and Answers Search