[go: up one dir, main page]

0% found this document useful (0 votes)
10 views2 pages

PT-4-CH-234-Linear-Programming

The document outlines a performance task for a Management Science course, focusing on linear programming problems. It includes three main problems involving resource allocation for products and nutritional requirements for a diet, requiring students to formulate models, solve for optimal production quantities, and determine objective function values. Each problem is broken down into specific tasks with points assigned for each part.

Uploaded by

エイアイ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views2 pages

PT-4-CH-234-Linear-Programming

The document outlines a performance task for a Management Science course, focusing on linear programming problems. It includes three main problems involving resource allocation for products and nutritional requirements for a diet, requiring students to formulate models, solve for optimal production quantities, and determine objective function values. Each problem is broken down into specific tasks with points assigned for each part.

Uploaded by

エイアイ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Kingfisher School of Business and Finance

BUSMATH 42: Management Science I


Performance Task 4: Chapter 2, 3, and 4: Linear Programming

I. PROBLEM SOLVING. (60 pts) Solve the following problems

Problem 1: (20 pts)

Problem 2: The following table summarizes the key facts about two products, A and B, and the resources, Q, R, and S,
required to produce them.

Resource Usage per Unit Produced


Resource Product A Product B Amount of Resource Available
Q 5 4 20
R 4 8 32
S 6 2 18
Profit/unit P5000 P7500

a. What is the objective of the problem? (1 pt.)


b. Let A represent Product A, and B represent Product B. Formulate a linear programming model for constraints (6
pts)
c. Solve the problem. Given the following ordered pairs (points), which are the corner points of the feasible region?
(10 pts)
d. How many Product A and B should be product to obtain the objective of the problem? (2 pts.)
e. What will be the optimal value for the objective function? (1 pt.)

Problem 3: Vinsmoke Sanji loves steaks and potatoes. Therefore, he has decided to go on a steady diet of only these two
foods (plus some liquids and vitamin supplements) for all his meals. Sanji realizes that this isn’t the healthiest diet, so he
wants to make sure that he eats the right quantities of the two foods to satisfy some key nutritional requirements. He has
obtained the following nutritional and cost information.

Grams of Ingredient per Serving


Daily Requirement
Ingredient Steak Potatoes
(Grams)
Carbohydrates 10 25 100
Protein 15 8 120
Fat 20 5 100
Cost per Serving P150 P300
Sanji wishes to determine the number of daily servings (may be fractional) of steak and potatoes that will meet
these requirements at a minimum cost.

a. What is the objective of the problem? (1 pt.)


b. Let S represent steak, and P represent potato. Formulate a linear programming model for constraints (6 pts)
c. Solve the problem. Given the following ordered pairs (points), which are the corner points of the feasible region?
(10 pts)
d. How many steak and potato should be product to obtain the objective of the problem? (2 pts.)
e. What will be the optimal value for the objective function? (1 pt.)
Kingfisher School of Business and Finance Performance Task 4: Chapter 2,3,4 Linear Programming

You might also like