PROBLEM 01:

The following table summarized the key facts above two products A and
B and the resources Q and R required to produce them. Formulate the
linear programming model for this problem.

Resource Resource usage per unit produced Amount of resources

Product A Product B available
Q 1 1 5
R 3 2 12
Profit per unit 6 5
PROBLEM 02:
A manufacturer produces three models I, II, and III of a certain
product using raw materials A and B. the following table gives the
data. Formulate the problem into a LPP in order to maximize the total
profit
Resource Requirement per unit Availability
I II III
A 5 2 4 5000
B 3 7 2 6000
Profit per unit 40 20 30
PROBLEM 03:
A manufacturer produces three models I, II, III of certain product
using raw materials A and B. The following table gives the data for the
problem. Formulate the LP model.

Raw Material Requirement per unit Availability

I II III
A 2 3 5 4000
B 4 2 7 6000
Min Demand 200 200 150
Profit per unit (Rs) 30 20 50
Problem 04:
A manufacturing company is engaged in producing three types of products:
A, B and C. The production department produces, each day, components
sufficient to make 50 units of A, 25 units of B and 30 units of C. The
management is confronted with the problem of optimizing the daily
production of the products in the assembly department, where only 100 man-
hours are available daily for assembling the products.
The following additional information is available:

The company has a daily order commitment for 20 units of products A and a
total of 15 units of products B and C. Formulate this problem as an LP model
so as to maximize the total profit.
PROBLEM 05: FORMULATING WORD PROBLEM TO LPP
A firm manufactures 2 types of products A & B and sells them
at a profit of Rs 2 on A and Rs 3 on B. Each products is
processed on 2 machines G & H. Product A requires 1 minute
processing time o G & 2 minutes on H. Product B requires 1
minute on each machine. The Machine G is available for not
more than 6 hours 4minutes while machine H is available for
10 hours during any working day. Formulate the Problem as an
LPP?
PROBLEM 06: FORMULATING WORD PROBLEM TO LPP
A firm can produce 3 types of cloth, A, B, C. 3 kinds of wool are
required - red, green and blue. 1 unit length of type A needs 2 meters of
red wool and 3 meters of blue wool. 1 unit length of type B needs 3
meters of red wool, 2 meters green & 2 meters of blue wool. 1 unit of
type C requires 5meters of green wool & 4 meters of blue wool. The
firm has stock of 8meters of red wool, 10meters or green wool &
15meters of blue wool. The income obtained from 1 unit length of type
A cloth is Rs 3, type B cloth is Rs 5 & type C cloth is Rs 4. Determine
how the firm should use the available material, to maximize its income.
 Work Scheduling Problem
A post office requires different number of full time employees on different
days of the week. The daily requirement is given in the table below.
Days of the week Number of full time employees required
1 = Monday 17
2 = Tuesday 13
3 = Wednesday 15
4 = Thursday 19
5 = Friday 14
6 = Saturday 16
7 = Sunday 11

The union rules state that each full time employee must work for five
consecutive days and then take two days off. Formulate an LPP, so that the
post office can minimize the number of full time employees who should be
hired.
• A company has two plants, each of which produces and supplies two
products: A and B. The plants can each work up to 16 hours a day. In
plant 1, it takes three hours to prepare and pack 1,000 gallons of A and
one hour to prepare and pack one quintal of B. In plant 2, it takes two
hours to prepare and pack 1,000 gallons of A and 1.5 hours to prepare
and pack a quintal of B. In plant 1, it costs Rs 15,000 to prepare and pack
1,000 gallons of A and Rs 28,000 to prepare and pack a quintal of B,
whereas in plant 2 these costs are Rs 18,000 and Rs 26,000, respectively.
The company is obliged to produce daily at least 10 thousand gallons of A
and 8 quintals of B. Formulate this problem as an LP model to find out as
to how the company should organize its production so that the required
amounts of the two products be obtained at the minimum cost.
 Industrial Problem
A company has 3 operational departments, these departments are
called the weaving, processing and packaging with the capacity to
produce 3 different types of clothes which are called as suiting,
shirting and woolen yielding a profit of rupees 2, rupees 4 and rupees
3 per meter respectively.
1 meter suiting requires 3 minutes in weaving, 2 minutes in processing
and 1 minute in packing. Similarly, 1 minute of shirting requires 2
minutes in weaving, 1 minute in processing and 3 minutes in packing,
while 1 meter of woollen requires 3 minute in each department.
In a week total runtime of each department is given to be 60, 40 and
80 hours of weaving, processing and packing department respectively.
Formulate the problem as a LPP to find the product in such a way that
the profit is maximized.
 Advertising Problem
The owner of a Win-win Sports company wishes to determine how many advertisements to
place in the monthly magazines A, B and C. His objective is to advertise in such a way that the
total exposure to the principle buyers of the expensive sports good is maximized.
The percentage of readers of each magazine is known. Exposure in any particular magazine is
the number of advertisements placed in that magazine multiplied by the number of principle
buyers. This data may be used
Magazine A Magazine B Magazine C
Reader 1 Lakh 0.6 Lakh 0.4 Lakh
Principal Buyers 20% 15% 8%
Cost Per Advt (Rs) 8000 6000 5000

The budget amount is at most rupees 1 lakh for the advertisement and the owner has already
decided that magazine A should have no more than 15 advertisements and that the B and C
magazines have at least 80 advertisements. Formulate an LPP
Let x1, x2, x3 be the number of insertions in the magazine
Maximize Z = (20% of 1,00,000) x1 + (15% of 60,000) x2 + (8% of 40,000) x3
Maximize Z = 20000 x1 + 9000 x2 + 3200 x3

Subject to constraints
8000 x1 + 6000 x2 + 5000 x3 ≤ 1,00,000 (Budgeting)

x1 ≤ 15, x2 ≥ 80, x3 ≥ 80 (Advertising)

And x1 ≥ 0, x2 ≥ 0, x3 ≥ 0
PROBLEM 07: FORMULATING WORD PROBLEM TO LPP
Suppose an industry is manufacturing two types of products P1 and P2. The profits per Kg
of the two products are Rs.30 and Rs.40 respectively. These two products require
processing in three types of machines. The following table shows the available machine
hours per day and the time required on machine to produce one Kg of P1 and P2.
Formulate the problem in the form of linear programming model

P1 P2 Total available Machine hours / day

Machine 1 3 2 600
Machine 2 3 5 800
Machine 3 5 6 1100
Profit/Kg Rs.30 Rs.40