Chapter 04 (QP)
Chapter 04 (QP)
04 Linear Programming
Q1 Sufi Pvt Limited produce two products Oil and ghee which must pass through the same
processes in department A and B having weekly production capacities of 200 hours and
150 hours respectively Oil needs 4 hours in department A and 2 hours in department B.
Ghee requires 3 hours and 1 hour respectively . Sufi wants to maximize the profit with
given set of inequalities.
(a) Z = 700 x + 500 y (b) Z = 700 x + 500y
2x + 3y < 200 4x + 3y < 200
4x + 3y < 200 2x + y < 150 x, y > 0
X, y > 0 (d) None of these
(c) Z = 700x + 500y
4x + 3y ≤ 200
2x + y ≥ 150
Q.2 For the following inequalities
x, y > 1
x > y,
x, y < 4, find the feasible region is:
(a) (b)
Q.3 A factory produces Transformers and Switches gears. The production is carried out in
two departments A & B. The machines in department a can work up to 6 hours per day
whereas those in department B can work up to 7.5 hours per day. A transformer requires
4 hours in department A & 3 hours in department B, whereas a switch gear requires 2
hours in department A & 5 hours in department B. The profit margin on transformer is Rs
5,000 and on a switch gear is Rs. 6,000. Assume a month have 20 working days.
(i) What are the constraints and objective function for the month?
(a) 4x + 2y < 120 (b) 4x + 3y < 120
3x + 5y < 150 2x + 5y < 150
P = 5000x + 6000y P = 5000x + 6000y
(c) 4x + 2y > 120 (d) 4x + 2y < 120
3x + 5y > 150 3x+5y > 150
P = 5000x + 6000y P = 5000x + 6000y
M.SHOAIB(M.PHIL) PRC-2
Chapter No. 04 Linear Programming
(ii) How many transformers and switch gears may be produced to maximize monthly
profit?
(a) 21 transformers & 17 switchgears
(b) 17 transformers & 21 switchgears
(c) 30 transformers & 30 switchgears
(d) None of these
(iii) What is the maximum monthly profit?
(a) Rs 150,000 (b) Rs 180,000
(c) Rs 207,000 (d) Rs 301,000
(iv) How many machine hours will remain idle during the month in each department
at the maximum level of profit?
(a) No idle machine hours in any department
(b) 2 hours in each department
(c) 1 hours in each department
(d) None of these
Q.4 Which of the following is a redundant constraint?
L1 5x + 3y ≤ 9,000
L2 3x + 2y ≤ 8,400
L3 x ≤ 1,000
L4 Y ≤ 1,000
(a) L1 (b) L2
(c) L3 (d) None of these
Q.5 Arsam manufacturing limited makes and sell two products x and y. the related
information is as follows:
X Y
Contributing per unit 375 250
Maximum sale demand per unit 6,000 9,000
Direct labour hours per unit 1 2
Machine hours per unit 3 4
A total of 10,000 direct labour hours and 22,000 machine hours are available per month.
Which of the following objective function (z) and set of constraints represent the above
situation?
(a) Z=375x + 250y (b) Z=375x + 250y
x + 2y ≤ 10,000 x + 3y ≤ 10,000
3x + 4y ≤ 22000 2x + 4y ≤ 22000
x ≤ 6000, y ≤ 9000 x ≤ 6000, y ≤ 9000
x, y ≥ 0 x, y ≥ 0
M.SHOAIB(M.PHIL) PRC-2
Chapter No. 04 Linear Programming
M.SHOAIB(M.PHIL) PRC-2
Chapter No. 04 Linear Programming
M.SHOAIB(M.PHIL) PRC-2
Chapter No. 04 Linear Programming
Q.15 The rules and regulations demand that the employer should employ not more than 5
experienced hands to 1 fresh one. This fact can be expressed as:
(a) y ≥ 𝑥/5 (b) 5y < 𝑥
(c) 𝑥 > 5y (d) None of these
Q.16 The union however forbids him to employ less than 2 experienced person to each fresh
person. This situation can be expressed as:
(a) 𝑥 < y/2 (b) y ≤ 𝑥/2
(c) y > 𝑥/2 (d) 𝑥 > 2y
Q.17 A manufacturer produces two products X1 and X2. Resources available for the
production of these two items are restricted to 100 support staff hours, 200 machine hours
and 400 labour hours. X1 requires for its production 1 support staff hour, 1 machine hour
and 2 labour hours. X2 requires 1 support staff hour, 2 machine hours and 0.8 labour
hours. X1 yields Rs.300 profit per unit and X2 yields Rs.200 profit per unit. The
manufacturer wants to determine the profit maximizing weekly output of each product
while operating within the set of resource limitations. Situation of the above data in the
form of equations and inequalities is:
(a) Z = 300𝑥 + 200y (b) Z = 300𝑥 + 200y
𝑥 + y 100 𝑥 + y 200
𝑥 + 2y 200 3𝑥 + 2y 400
2𝑥 + 0.8y 400 2𝑥 + 0.8y 200
𝑥 0, y 0 𝑥 0, y 0
(c) Z = 300𝑥 + 200y (d) None of these
𝑥 + y 200
𝑥 + 2y 300
2𝑥 + 0.8y 4000
Q.18 A factory is planning to buy some machine to produce boxes and has a choice of B-1 or
B-9 machines. Rs.9.6 million has been budgeted for the purchase of machines. B-1
machines costing Rs.0.3 million each require 25 hours of maintenance and produce 1,500
units a week. B-9 machines costing Rs.0.6 million each require 10 hour of maintenance
and produce 2,000 units a week. Each machine needs 50 square meters of floor area.
Floor area of 1,000 square meters and maintenance time of 400 hours are available each
week. Since all production can be sold, the factory management wishes to maximize
output. Situation of above data in the form of objective function and constraints is:
(a) Z = 1500𝑥 + 2000y (b) Z = 1500𝑥 + 2000y
0.3𝑥 + 0.6y 9.6 0.3𝑥 + 0.6y 9.6
25𝑥 + 10y 400 25𝑥 + 10y 400
50𝑥 + 50y 1000 50𝑥 + 50y 1000
𝑥 0, y 0 𝑥 0, y 0
(c) Z = 1500𝑥 + 2000y (d) Z = 1500𝑥 + 2000y
0.3𝑥 + 0.6y 9.6 0.3𝑥 + 0.6y 9.6
25𝑥 + 10y 400 25𝑥 + 10y 400
50𝑥 + 50y 1000 50𝑥 + 50y 1000
𝑥 0, y 0 𝑥 0, y 0
M.SHOAIB(M.PHIL) PRC-2
Chapter No. 04 Linear Programming
M.SHOAIB(M.PHIL) PRC-2
Chapter No. 04 Linear Programming
Q.26 The maximum number of constraints while solving a business problem using linear
programming is
(a) 1 (b) 2
(c) 3 (d) there is no specific limit
Q.27 Feasible region is a _________
(a) Region which satisfies all given constraints
(b) Region which is in first quadrant
(c) Region above the last mentioned constraint
(d) Always below all the constraints in a given scenario
Q.28 Corner point theorem states __________
(a) Optimal solution is at one of the corners of feasible region.
(b) Optimal solution is within feasible region.
(c) Profit is maximum at all corners of a feasible region.
(d) Revenue is maximum at all corners of a feasible region.
Q.29 Linear programming model can be used for _____
(a) Profit maximization (b) Cost minimization
(c) Both (d) None
Q.30 Minimum number of constraints to draw a feasible region is/are:
(a) 1 (b) 2
(c) 3 (d) 4
Q.31 A bounded feasible region will:
(a) Have both maximum and minimum value
(b) Have maximum value only
(c) Have minimum value only
(d) None of these
Q.32 Y ≤ X will have a feasible region: __
(a) Above Y axis only (b) Below Y axis only
(c) Above X axis only (d) Below or on the line Y=X
Q.33 In a linear programming problem, the constraints are as follows:
x>0
y > 150
x + y < 450
4x + y < 600
What is the maximum possible value of the objective function, x + 3y, given these
constraints?
(a) 1250 (b) 1350
(c) 562.5 (d) None of these
M.SHOAIB(M.PHIL) PRC-2
Chapter No. 04 Linear Programming
**********
M.SHOAIB(M.PHIL) PRC-2