Scribd
Upload
368 views2 pages

Practice Questions For Graphical MethoD or Simplex MethoD

This document contains 4 questions that present linear programming optimization problems. Question 1 involves minimizing costs to meet fertilizer ingredient requirements. Question 2 involves maximizing profit from producing coffee cakes and Danish pastries given ingredient constraints. Question 3 involves maximizing profit from producing two products given time constraints on two assembly lines. Question 4 involves maximizing daily profit from producing two products given time constraints on two machines. For each question, students are asked to formulate a linear programming model and solve it graphically or using the Simplex Method.

Uploaded by

Nazir Ansari
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
368 views2 pages

Practice Questions For Graphical MethoD or Simplex MethoD

This document contains 4 questions that present linear programming optimization problems. Question 1 involves minimizing costs to meet fertilizer ingredient requirements. Question 2 involves maximizing profit from producing coffee cakes and Danish pastries given ingredient constraints. Question 3 involves maximizing profit from producing two products given time constraints on two assembly lines. Question 4 involves maximizing daily profit from producing two products given time constraints on two machines. For each question, students are asked to formulate a linear programming model and solve it graphically or using the Simplex Method.

Uploaded by

Nazir Ansari
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

Bahria University, Karachi Campus

Department of Management Sciences

Q#1: The Kalo Fertilizer Company makes a fertilizer using two chemicals that
provide nitrogen, phosphate, and potassium. A pound of ingredient 1
contributes 10 ounces of nitrogen and 6 ounces of phosphate, while a pound of
ingredient 2 contributes 2 ounces of nitrogen, 6 ounces of phosphate, and 1
ounce of potassium. Ingredient 1 costs $3 per pound, and ingredient 2 costs $5
per pound. The company wants to know how many pounds of each chemical
ingredient to put into a bag of fertilizer to meet the minimum requirements of
20 ounces of nitrogen, 36 ounces of phosphate, and 2 ounces of potassium
while minimizing cost.

a. Formulate a linear programming model for this problem.


b. Solve this model by using graphical analysis.

Q#2: The Crumb and Custard Bakery makes coffee cakes and Danish pastries
in large pans. The main ingredients are flour and sugar. There are 25 pounds
of flour and 16 pounds of sugar available, and the maximum demand for
coffee cakes is 5. Five pounds of flour and 2 pounds of sugar are required to
make a pan of coffee cakes, and 5 pounds of flour and 4 pounds of sugar are
required to make a pan of Danish. A pan of coffee cakes has a profit of $1, and
a pan of Danish has a profit of $5. Determine the number of pans of cakes and
Danish to produce each day so that profit will be maximized.

a. Formulate a linear programming model for this problem.


b. Solve this model by using graphical analysis or Simplex Method

Q#3: A company produces two products that are processed on two assembly lines. Assembly line
1 has 100 available hours, and assembly line 2 has 42 available hours. Each product requires 10
hours of processing time on line 1, while on line 2 product 1 requires 7 hours and product 2
requires 3 hours. The profit for product 1 is $6 per unit, and the profit for product 2 is $4 per
unit.

a. Formulate a linear programming model for this problem.

b. Solve this model by using graphical analysis or Simplex Method

Q#4: A company produces two products A & B that are produce by machines X & Y. Profit per
unit on products A & B are Rs. 40 & Rs. 50 respectively. One unit of product A required 2
minutes on machine X and 3 minutes on machine Y, while one unit of product B required 2
minutes on machine X and 2 minutes on machine Y. If Machine X is available for maximum 5
hours and 30 minutes and Machine Y is available for maximum 8 hours during any working day.
Company desires to know how many products A and B produce daily in order to maximize
profit.

a. Formulate a linear programming model for this problem.


b. Solve this model by using graphical analysis or Simplex Method

You might also like