Scribd
Upload
32 views

Tutorial Two

The document contains 10 linear programming problems involving maximization or minimization of objectives subject to constraints. The problems involve determining optimal production quantities, investment amounts, or resource allocation to maximize profit or minimize costs. Graphical and algebraic methods are presented as approaches to solve the linear programming problems.

Uploaded by

Rajneet Chand
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
32 views

Tutorial Two

The document contains 10 linear programming problems involving maximization or minimization of objectives subject to constraints. The problems involve determining optimal production quantities, investment amounts, or resource allocation to maximize profit or minimize costs. Graphical and algebraic methods are presented as approaches to solve the linear programming problems.

Uploaded by

Rajneet Chand
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial two

Linear Programming Problems.


Solve the following LPPs using Graphical Method
(1) Maximize: 𝑃=0.25𝑥+0.45𝑦
𝑥+2𝑦≤300
3𝑥+2𝑦≤480
𝑥≥0,
𝑦≥0

(2) Maximize: 𝑍=3𝑥+4𝑦


subject to: 2𝑥+𝑦≤40
2𝑥+5𝑦≤50
𝑥 ≥0,
𝑦≥0

(3) Minimize: 𝑍=2𝑥+3𝑦


subject to: 𝑥+2𝑦 ≥40
2𝑥+𝑦≥50
𝑥≥0,
𝑦≥0

(4) There are two coffee machines at the Coffee for Fun Company Ltd that blends three types of coffee. The first type
is Light Coffee, second type is Strong Coffee, and the third type is Casual Coffee. At each machine, the coffee is
blended in a single production run so the three types are blended in fixed proportions. The first machine (Machine
Beta) produces 1 kg of Light Coffee, 2 kg of Strong Coffee, and 3 kg of Casual Coffee in a single operation, and it
charges $60 for what is blended in one operation. The second machine (Machine Zeta) blends 1 kg of Light Coffee, 5
kg of Strong Coffee, and 1 kg of Casual Coffee, and it charges $100 for what it blends in one operation. If a customer
wants at least 100 kg of Light Coffee, 260 kg of Strong Coffee, and 180 kg of Casual Coffee, respectively, then how
many production runs should be ordered from each machine to minimize costs? What is the minimum cost?

(5) A retired couple has up to $30,000 to invest in fixed-income securities. Their broker recommends investing in two
bonds: one AAA bond yielding 8%; the other a B+ bond paying 12%. After some consideration, the couple decides to
invest at most $12000 in the B+ rated bond and at least $6000 in the AAA bond. They also want the amount invested
in the AAA bond to exceed or equal the amount invested in the B + bond. What should the broker recommend if the
couple wish to maximize their return on investment?

(6) Quality Carpet manufacturers has available 1200 square meters of wool and 1000 square meters of nylon for the
manufacturing of two grades of carpets: high-grade, which sells for $500 per roll, and low-grade, which sells for $300
per roll. 20 square meters of wool and 40 square meters of nylon are used in a roll of high-grade carpet, and 40 square
meters of nylon are used in a roll of low-grade carpet. 40 work hours are required to manufacture each roll of high-
grade carpet and 20 work hours are required for each roll of low-grade carpet. A maximum of 800 work hours are
available. Calculate the optimum quantity of high-grade and low-grade of carpets that needs to be manufactured to
maximize sales revenue

(7) Solve the following problem using the Graphical method.


Maximize: 𝑍 = 15𝑥 + 25y
Subject to: 5𝑥 + 5y≤ 25 ;
10𝑥 + 15y≤ 60
𝑥≥0,y≥0
Page | 1
(8) A firm manufactures two types of products, A and B, and sells that at a profit of $2 on type A and $3 on type B.
Each product is processed on two machines, M1 and M2. Type A requires 1 minute of processing time on M 1 and 2
minutes on M2. Type B requiring 1 minute on M1 and 1 minute on M2. Machine M1 is available for not more than 6
hours and 40 minutes, while machine M2 is available for a maximum of 10 hours only. The firm wishes to maximize
profit and asked you to compute the amount of Product A and B that should be manufactured.

(9) Minimize: 𝑊=1200𝑤1+ 1600𝑤2


Subject to: 20𝑤1+ 40𝑤2≥10

10𝑤1+10𝑤2≥4
𝑤1≥0,𝑤2≥0

(10) Minimize: 𝑍= 10𝑥1 + 20𝑥2


Subject to: 4𝑥1 + 2𝑥2≥ 25

3𝑥1 + 3𝑥2≥30
𝑥1≥0,𝑥2≥0

Page | 2

You might also like