0% found this document useful (0 votes)
26 views9 pages

CHAPTER 04.mcqs Pac Sir QM

The document discusses linear programming problems involving the production of various products under constraints related to time, resources, and profits. It includes multiple questions with options regarding objective functions, constraints, and optimal production quantities. The scenarios cover different manufacturing setups and the mathematical formulations needed to maximize profits while adhering to given limitations.

Uploaded by

fatima669944nfn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views9 pages

CHAPTER 04.mcqs Pac Sir QM

The document discusses linear programming problems involving the production of various products under constraints related to time, resources, and profits. It includes multiple questions with options regarding objective functions, constraints, and optimal production quantities. The scenarios cover different manufacturing setups and the mathematical formulations needed to maximize profits while adhering to given limitations.

Uploaded by

fatima669944nfn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Chapter No.

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 A function which is to be maximized or minimized is called _________ function.
(a) Optimal (b) Feasible
(c) Objective (d) Corner
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
(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

M.SHOAIB(M.PHIL) PRC-2-QM
Chapter No. 04 Linear Programming

(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
(c) Z=375x + 250y (d) Z=375x + 250y
x + 3y > 10,000 x + 3y ≤ 10,000
2x + 4y > 22000 2x + 4y ≤ 22000
x ≤ 6000, y ≤ 9000 x > 6000, y > 9000
x, y ≥ 0 x, y ≥ 0
Q.6 A company owns a machine which runs for 208 hours a month. The machine is used to
make two parts x and y. Each part x take 1 hour of machine time and each part y takes 2
hours of machine time. If x represent the number of part x made in a month and y
represent the number of part y made in a month, which of the following
statement/inequalities is correct?
(a) The company could make any quantity of X and Y but the total machine hours in
a month cannot exceed 208.

M.SHOAIB(M.PHIL) PRC-2-QM
Chapter No. 04 Linear Programming

(b) X + 2y < 208 represent the boundary of maximum production in a month


(c) Y < 208 if x = 0, represent the maximum production of y in a month
(d) Both (a) and (b)
Q.7 A company produces two products x and y. each product passes through machine M1 and
M2 which have a capacity of 2000 hours and 1500 hours respectively. Product x requires
3 hour on machine M1 and 4 hours on Machine M2. Product Y requires + Hours on
machine M1 and 4 hours on Machine M2. The profit margin on x and y is Rs. 500 and Rs
600 respectively. Construct the function relating to the above situation.
(a) 2000 M1 + 1500 M2 (b) 222.22x + 187.5Y
(c) 500x + 600y (d) 600 x + 500 y
Q.8 Which of the following constraints is shown?

(a) 12x + 8y ≤ 24 (b) 2x + 3y ≤ 24


15x + 9y ≤ 45 3x + 5y ≤ 45
x≤4 x≤4
x, y ≥ 0 x, y ≥ 0
(c) 8x + 12y ≤ 24 (d) 2x + 3y ≤ 24
15x + 9y ≤ 45 3x + 5y ≥ 45
x≤4 x≤4
x, y ≥ 0 x, y ≥ 0

Q.9 Find the maximum profit if P = 250x + 375y


Constraints are: 4x + 2y ≤ 25000
3x + 2y ≤ 20000 x, y ≥ 0
(a) 2187500 (b) 4687500
(c) 1250000 (d) None of these
Q.10 The solution set of x < 4 is?
(a) -∞<x<4 (b) 4<x<∞
(b) 0<x<4 (c) -∞<x<∞
Q.11 A company makes and sells two products x and y. the contribution per unit is Rs 250 for
product x and 375 for product y. due to various constraints, the company cannot make
more than 750 units of x and 500 units of y in a month. If x represents the number of

M.SHOAIB(M.PHIL) PRC-2-QM
Chapter No. 04 Linear Programming

product x, y represents the number of product y and c represents contribution, which of


the following relationship represents maximum contribution?
(a) C = 250x + 375y (b) C = 250x + 500y
(c) C = 500x + 125y (d) C = 3x + 1.33y
Q.12 Which set of a point satisfy the equation y – 2x = - 4
(a) (6, -5) (b) (5, 6)
(c) (2,5) (d) (2,2)
Q.13 An employer recruits experienced (𝑥) and fresh workmen (y) for his firm under the
condition that he cannot employ more than 9 people, 𝑥 and y can be related by the
inequality:
(a) 𝑥+y9 (b) 𝑥 + y ≤ 9, 𝑥 > 0, y > 0
(c) 𝑥 + y ≥ 9, 𝑥 > 0, y > 0 (d) None of these
Q.14 On the average, an experienced person does 5 units of work while a fresh recruit does 3
units of work daily and the employer has to maintain an output of at least 30 units of
work per day. This situation can be expressed as:
(a) 5𝑥 + 3y ≤ 30 (b) 5𝑥 + 3y > 30
(c) 5𝑥 + 3y ≥ 30, 𝑥 > 0, y > 0 (d) None of these
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

M.SHOAIB(M.PHIL) PRC-2-QM
Chapter No. 04 Linear Programming

(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
Q.19 A manufacturing company produces two products A and B. Production of A will be at
least five times the production of B. This situation can be expressed as:
(a) b ≥ 5a (b) b ≤ 5a
(c) a ≤ 5b (d) a ≥ 5b
Q.20 A Domestic manufacturer produces two products A and B. Each unit of A requires 3kg of
raw material and 2 labour hours whereas each unit of B requires 2kg or raw material and
2 labour hours. Total raw material available is 200kg whereas total labour hours available
are 150 hours. This situation can be expressed as:
(a) 3a+2b ≥ 200 and 2a+2b ≥ 150 (b) 3a+2b ≤ 200 and 2a+2b ≤ 150
(a) 3a+2b ≤ 150 and 2a+2b ≤ 200 (d) 3a+2b ≥ 150 and 2a+2b ≥ 200
Q.21 Inequalities 𝑥 ≥ 0 and y ≥ 0 suggest that feasible region will be in _____ quadrant.
(a) 1st (b) 2nd
(c) 3rd (d) 4th
Q.22 Which of the following values of 𝑥 and y does not satisfy the inequality 2𝑥+3y ≤ 6?
(a) (1, 1) (b) (0, 1)
(c) (3, 1) (d) (1, 0)
Q.23 A machine can work for 16 hours per day at most. It takes 4 hours to produce one unit of
product A and 8 hours to produce one unit of product B. This information can be expressed
as:

M.SHOAIB(M.PHIL) PRC-2-QM
Chapter No. 04 Linear Programming

(a) 4a + 8b ≤ 16
(b) 4a + 8b ≥ 16
(c) 4a + 8b = 16
(d) Not possible to express information
Q.24 Which of the following constraint will have a feasible region with coordinate (2, 3) in it?
(a) 10𝑥 + 5y ≤ 40 (b) 10𝑥 + 5y ≤ 30
(c) 10𝑥 + 5y ≤ 10 (d) 10𝑥 + 5y ≤ 20
Q.25 Public Pharma limited produces two medicines. Each of which requires two types of raw
material with following details:
Product Product A Product B Total Available
Raw material X 2 3 120
Raw material Y 4 6 360
Form appropriate constraints as per above information
(a) 2a+3b ≤ 120 and 4a+6b ≤ 360
(b) 2𝑥+4y ≤ 120 and 3𝑥+6y ≤ 360
(c) 4a+6b ≤ 120 and 2a+3b ≤ 360
(d) 2𝑥+3y ≤ 120 and 4a+6b ≤ 360
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

M.SHOAIB(M.PHIL) PRC-2-QM
Chapter No. 04 Linear Programming

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

Q.34 Find constraints using the graph

(a) y>x+4 (b) y≤x+4


(c) y≥x-4 (d) y≤x-4
Q.35 Which point below is NOT the part of solution set?

(a) (0,0) (b) (-10,20)


(c) (3,5) (d) (0,-2)

M.SHOAIB(M.PHIL) PRC-2-QM
Chapter No. 04 Linear Programming

Q.36 A redundant constraint is eliminated from a linear programming model. What effect will
this have on the optimal solution?
(a) feasible region will decrease in size
(b) feasible region will increase in size
(c) a decrease in objective function value
(d) no change

Q.37

Lisa and Tammy are selling items at the craft show. Which might be the reasonable
solution from the graph showing the number of items sold and when they both have
earned the same amount?
(a) (1,12) (b) (3,19)
(c) (5,25) (d) (0,10)
Q.38 A company has three workers with each worker working for eight hours per day.
Workers produce handmade footballs. Each football takes 2 hours of labour time.
Represent the daily production of the company using inequality
(a) X ≤ 8 and x ≤ 0 (b) X ≤ 8 and x ≥ 0
(c) X ≤ 24 and x ≤ 0 (d) X ≤ 12 and x ≥ 0
Q.39 According to corner point theorem the optimum solution lies _______.
(a) At origin (b) Outside the feasible region
(c) Inside the feasible region (d) at a corner of the feasible region
Q.40 Identify cost minimizing output for the following information:
Objective function: C = 200x + 100y
Corner points of feasible region: (2,7), (4,0) and (6,7)
(a) (2,7) (b) (4,0)
(c) (6,7) (d) None of these
Q.41 For the following information:
Objective function: Z = 5x + 2y
Constraints: X ≤ 10, y ≤ 9, x ≥ 3 and y ≥ 1

M.SHOAIB(M.PHIL) PRC-2-QM
Chapter No. 04 Linear Programming

Which of the values of objective function is possible to achieve?


(a) 68 (b) 73
(c) 75 (d) 77
Q.42 If 3x+7 ≥ x+5 ≥ 5x – 3, then the inequality holds when x lies in the range
(a) 7≤x≤–3 (b) 5≥x≥7
(c) 3≤x≤5 (d) 2≥x≥–1

Q.43 If 3x+7 ≤ 5x – 3, then the inequality holds when x lies in the range.
(a) Less than or equal to 7 (b) Greater than or equal to 5
(c) Less than or equal to 5 (d) Greater than or equal to 2

****************

M.SHOAIB(M.PHIL) PRC-2-QM

You might also like