Scribd
Upload
4 views

Linear Programming Problem_Mathematical Questions

The document presents four linear programming problems related to manufacturing and production optimization. Each problem involves determining the optimal quantity of products to produce in order to maximize profit or minimize costs, given constraints on materials, processing time, and production costs. The scenarios include manufacturing pants and jackets, products X and Y, storm windows, and different types of locks, each with specific resource limitations.

Uploaded by

nazmulhasanrafee
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
4 views

Linear Programming Problem_Mathematical Questions

The document presents four linear programming problems related to manufacturing and production optimization. Each problem involves determining the optimal quantity of products to produce in order to maximize profit or minimize costs, given constraints on materials, processing time, and production costs. The scenarios include manufacturing pants and jackets, products X and Y, storm windows, and different types of locks, each with specific resource limitations.

Uploaded by

nazmulhasanrafee
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/ 1

Linear Programming Problem Questions (For Quiz-2 and Final )

1. A manufacturer wants to produce pants and sports jackets. For materials: the manufacturer
has 750 m2 of cotton textile and 1000 m2 of polyester. Every pair of pants (1 unit) needs 1 m2
of cotton and 2 m2 of polyester. Every jacket needs 1.5 m2 of cotton and 1 m2 of polyester. The
price of pants is fixed at 50 taka and jacket 40 taka, and their production costs are 35 taka
and 30 taka respectively. What is the number of pants and jackets that the manufacturer
must produce so that these items obtain a maximum profit?

2. A company makes two products (X and Y) using two machines (A and B). Each unit of X that is
produced requires 1 hour processing time on machine A and 0.5 hour processing time on
machine B. Each unit of Y that is produced requires 0.25 hour processing time on machine A
and 0.75 hour processing time on machine B. Available processing time on machine A is 40
hours and on machine B is forecasted to be 35 hours. The cost of per unit X is 15 Taka and
per unit Y is 20 Taka.

Formulate the problem of deciding how much of each product to make in the current week
as a linear program to minimize the cost.

3. Star Insulating Company manufactures two types of storm windows: Model H (the heavy
duty) and Model R (the regular). Model H sells for $45 per window and costs $36 per window
to make, whereas Model R sells for $35 per window and costs $27 per window to make. To
make one model H window, it requires 4 hours on machine A and 3 hours on Machine B. On
the other hand, to make one Model R window, it takes 5 hours on Machine A and 2 hours on
Machine B. Production scheduling indicates that during the coming week Machine A will be
available for at most 30 hours and Machine B for at most 19 hours. How many of each
window should the company make in the coming week in order to maximize its profit? What
is this maximum profit?

4. Safety Lock Company makes two kinds of locks: Model SS (the super safe) and Model S (the
safe). Each Model SS lock sells for $24 and costs $19 to make, while each Model S lock sells
for $18 and costs $15 to make. Each of the locks must be processed on two machines: Model
SS requires 3 hours of Machine A and 2 hours on Machine B, whereas Model S requires 7
hours on A and 1 hour on B. During the coming week Machine A will be free for no more
than 42 hours and Machine B for no more than 17 hours. Determine the number each kind
of lock to be made in the coming week for the company to maximize its profit. What is this
maximum profit?

You might also like