Chapter Name: Linear Programming

Chapter Name: Linear Programming
Topic: Introduction
Mcq’s Type: Definition
1.The term programming means that
A. Planning
B. Disorder
C. Forget
D. Destroy
Answer: A Planning
Difficulty Level: High
Logical Reasoning (If applicable): Not Applicable
_____________________________________________________________________
2. The term Linear means that

A. All relationship involve in particular program
B. All relationship are in Disorder form
C. All relationship involve in particular program
D. All relationship must be Destroyed
Answer: A All relationship involve in particular program
Difficulty Level: Medium
_____________________________________________________________________
3. The Linear program is a method for

A. For disordering problem
B. For planning problem
C. For solving problem
D. All of these
Answer: C For solving problem
_____________________________________________________________________
4. The Linear program is a method for solving problems in which a linear function is to be
maximizes or minimized, such problems are called
A. Linear Programming
B. Optimization Problem
C. Linear Programming Problem
D. A&B
Answer: C Linear Programming Problem
_____________________________________________________________________
5. Planning of allocation of limited resources to obtain an optimal result is called:

A. Optimization Problem
B. Linear Inequalities
D. Linear Programming
Answer: D Linear Programming
_____________________________________________________________________
6. The theory of linear programming is a fairly

A. 10 decay advancement in mathematics
B. Past advancement in mathematics
C. Recent advancement in mathematics
D. All of these
Answer: C Recent advancement in mathematics
_____________________________________________________________________
7. Linear programming was developed over the past ……… to deal with the increasingly
more complicated problems of our technological society.
A. Ten Decades
B. Four Decades
C. Five Decades
D. One Decades
Answer: B Four Decades
_____________________________________________________________________
Topic: Linear Inequalities

8. A statement that one mathematical quantity is less than or greater than or less than or
equal to or greater than or equal to another quantity is called
A. Planning
B. Inequalities
C. Linear Inequalities
D. All of these
Answer: C Linear Inequalities
_____________________________________________________________________
9. Less than is denoted by

A. <
B. =
C. >
D. A&B
Answer: A <
_____________________________________________________________________
10. Greater than is denoted by

A. <
B. =
C. >
D. A & B
Answer: C >
_____________________________________________________________________
11. Less than or equal to is dented by

A. <
B. =
C. >
D. ≤
Answer: D ≤
_____________________________________________________________________
12. Greater than or equal to is denoted by

A. <
B. ≥
C. >
D. ≤
Answer: B ≥
_____________________________________________________________________
13. Inequalities of the form ax < b, ax ≤ b, ax > b, ax ≥ b where a <> 0, b are constants are
called
A. Optimization Problem
D. Linear Inequalities in one Variable
Answer: D Linear Inequalities in one Variable
_____________________________________________________________________
14. The solutions of a linear inequality in one variable x are values of x which satisfy the
linear inequality. The set consisting of all solutions of the linear inequality is called the
A. Solution Set
C. Solution
D. All of these
Answer: A Solution Set
_____________________________________________________________________
15. With each linear inequality in two variables x and y is associated a linear equation in
two variable x and y called
A. Associated Equation
C. Solution set
D. All of these
Answer: A Associated Equation
_____________________________________________________________________
16. The graph of a linear inequality, in more than two variables is a

B. Half plane
C. Solution set
D. All of these
Answer: B Half plane
_____________________________________________________________________
17. The Line ax + by = c that divides the plan is called
B. Half plane
C. Boundary
D. All of these
Answer: C Boundary
_____________________________________________________________________
18. If the boundary line is included in either plan then it is called

A. Closed Half Plan
B. Half plane
C. Boundary
D. All of these
Answer: A Closed Half Plan
_____________________________________________________________________
19. Two or more two linear inequalities togeth

B. Half plane
C. Boundary
D. All of these
Answer: C Boundary
Rejected: Statement is not clear/Complete.
_____________________________________________________________________
20. The common region obtained ----------- for the system of linear inequality is called
B. Half plane
C. Solution region
D. All of these
Answer: C Solution region
Rejected: In Statement two things ask but in options only one given.
_____________________________________________________________________
Topic: Feasible Region

21. The linear inequality involved in the problem is called
A. Problem Constraint
B. Linear Inequality
C. Decision Variable
D. A&B
Answer: A Problem Constraint
_____________________________________________________________________
22. The variables used in the system of linear inequalities relating to the problem are non-
negative
Is called
D. A&B
Answer: C Decision Variable
_____________________________________________________________________
23. In order to maximize or minimize the linear function f(x , y) = ax +by, is called
C. Decision Variables
D. Objective Function
Answer: D Objective Function
_____________________________________________________________________
24. The maximum or minimum value of objective function is achieved at one of the corner
of
B. Feasible Region
Answer: B Feasible Region
_____________________________________________________________________
25. The feasible solution which maximizes or minimizes the object function is called
A. Optimal Solution
Answer: A Optimal Solution
_____________________________________________________________________
26. The Procedure for finding the optimal solution of the objective function is
A. Ax + by = f(x,y)
B. f(x,y) = ax + by
C. F(x,y)
D. A&B
Answer: B f(x,y) = ax + by
Rejected : Please rewrite statement its wrong.
_____________________________________________________________________
27. In a LPP, the linear inequalities or restrictions on the variables are called
A. Inequalities
B. Linear constraints
C. Constraints
D. Limits
Answer: B Linear constraints
Logical Reasoning (If applicable):
In a LPP, the linear inequalities or restrictions on the variables are called Linear
constraints
_____________________________________________________________________
28. In linear programming infeasible solutions
A. fall on the x = 0 plane

B. fall inside the feasible region
C. fall outside the feasible region
D. fall inside the a regular polygon
Answer: C fall outside the feasible region
In linear programming infeasible solutions fall outside the feasible region .

_____________________________________________________________________
29. In linear programming problems the function whose maxima or minima are to be
found is called
A. Delta function
B. Selection function
C. Subjective function
D. Objective function
Answer: D Objective function
Logical Reasoning (If applicable): In linear programming problems the function
whose maxima or minima are to be found is called Objective function .
_____________________________________________________________________
30. Feasible region in the set of points which satisfy

(a) The objective functions
(b) Some the given constraints
(c) All of the given constraints
(d) None of these
Answer: C All of the given constraints

31. Of all the points of the feasible region for maximum or minimum of objective function
the points
(a) Inside the feasible region
(b) At the boundary line of the feasible region
(c) Vertex point of the boundary of the feasible region
(d) None of these
Answer: C Vertex point of the boundary of the feasible region

Rejected : Please rewrite statement.
32. Objective function of a linear programming problem is
(a) a constraint
(b) function to be optimized
(c) A relation between the variables
(d) None of these
Answer: B function to be optimized

33. A set of values of decision variables which satisfies the linear constraints and nn-
negativity conditions of a L.P.P. is called its
(a) Unbounded solution
(b) Optimum solution
(c) Feasible solution
(d) None of these
Answer: C Feasible solution

_____________________________________________________________________
Topic: Linear Inequalities
Mcq’s Type: Conceptual
34. Solve the Linear inequality x – 5 > 0
A. x<5
B. x>5
C. x < 10
D. y<5
Answer: B x > 5
35. Solve the Linear inequality 3x – 2 ≥ 8 +5x

A. x<5
B. x>5
E. x ≤ -5
C. y<5
Answer: C x ≤ -5
36. Graph the inequalities 2x – 5y ≥ 10

D. x<5
E. x = -2
F. x ≤ -5
F. y = -2
Answer: D y = -2
37. Graph the inequalities Y > X - 6

a) x<5
b) x>5
c) x ≤ -5
d) y = -4
Answer: D y = -4
Rejected : In question it is asking to draw a graph so in options there must be graphs.
38. Graph the inequalities Y > X - 4
a) x<5
b) y > -4
c) x ≤ -5
d) y=4
Answer: B y > -4
Rejected : In question it is asking to draw a graph so in options there must be graphs.
39. Identify the solution set for –( x – 3 ) < 5 – 2x
A. (−∞,−1)
B. None of these
C. (−∞,−5)
D. (−∞,2)
Answer : D (−∞,2)
40. What is the solution set for 2(x−1)5≤3(2+x)7 ?
A. (−4,∞)
B. (−24,∞)
C. (−12,∞)
D. (−44,∞)
Answer : D (−44,∞)
Rejected : Please rewrite statement solution does not exists in choices.
41. Identify the solution set for (x−1)3+4<(x−5)5−2.
A. (−∞,−5)
B. (−∞,−50)
C. (−∞,−15)
D. (−∞,-10)
Answer : B (−∞,−50)

42. Identify the solution set for 7x−58x+3>4

A. (−57,−38)
B. (−3128,−38)
C. None of these
D. (−1725,−38)
Answer : D (−1725,−38)
43. What is the solution set for 0<−x2<3
A. (5,6 )
B. ( - 6 , 0 )
C. None of these
D. (- 6 , 6 )
Answer : B ( - 6 , 0 )
44. Identify solution set for | 4 − x | + 1 < 3?
A. ( 2 , 6 )
B. ( 3 , 6 )
C. ( 2 , 4 )
D. ( 2 , 3 )
Answer: A ( 2 , 6 )
45. What is the solution set for |x−2|x−2>0 ?
A. ( -∞ , - 2 )
B. ( 2 , ∞)
C. ( 0 , 2 )
D. None of these
Answer: B ( 2 , ∞)
46. Identify the solution set for 1|x|−3<12 ?
A. (−∞,−5)∪(5,∞)
B. (5,∞)
C. None of these
D. (−∞,−5)∪(−3,3)∪(5,∞)
Answer : D (−∞,−5)∪(−3,3)∪(5,∞)
47. Which of the following is correct?
A. If 0 > -7 , then 0 < 7

B. If -4 < 7 , then 4 < - 7
C. If -2 < 5 , then 2 > 5
D. If 8 > 1 , then -8 > -1
Answer: A If 0 > -7 , then 0 < 7
48. Solve the inequality 3 − 2x ≤ 9

A. none of these
B. x ≤ − 3
C. x ≥ − 6
D. x ≥ − 3
Answer: D x ≥ − 3
49. Given that x is an integer, find the values of x which satisfy both 2x + 3 > 7 and x + 4 <
10
A. 4
B. 4 , 5
C. 3 , 4 , 5
D. 3
Answer: C 3 , 4 , 5
Rejected : All options are correct.
50. The solution for the simultaneous linear inequalities 2x − 3 ≤ 7 and − x ≤ 2 is :
A. − 5 ≤ x ≤ − 2
B. − 1 < x ≤ 2
C. − 2 ≤ x ≤ 5
D. None of these
Answer: C − 2 ≤ x ≤ 5
51. {4,5,6} is the solution set of
A. x > 4 and x > 7,xϵZ

B. x ≥ 4 and x ≤ 7 ,xϵZ
C. x > 4 and x < 7,xϵZ
D. x ≥ 4 and x < 7 ,xϵZ
Answer: D x ≥ 4 and x < 7 ,xϵZ
52. What are the integer values of x which satisfy the inequalities x>−2andx<2 ?
A. none of these
B. 1 , 2, 3, 4
C. - 1 ,0 ,1
D. - 1 , 0 , 1 , 2, 3
Answer : C - 1 ,0 ,1
53. Solve: 30x < 200, when x is a natural number:
A. {2,3,4,5,6}
B. {1,2,3,4,5,6,7}
C. { 1,2,3,4,5,6}
D. {4,5,6,7,8,9}
Answer : C { 1,2,3,4,5,6}
54. The solution set for : 3x − 7 >x + 3.

A. None of these
B. ( -5 , 5 )
C. (- 5 , ∞ )
D. ( 5, ∞)
Answer : D ( 5, ∞)
55. The solution set for ( x + 3 ) + 4 > − 2x + 5:

A. ( 2 , ∞)
B. (−2/3,∞)
C. None of these
D. ( - ∞ , - 2 )
Answer : B (−2/3,∞)
56. Solve the system of inequalities 2x + 5 ≤ 0 , x − 3 ≤ 0

A. x≤52
B. x≥−52
C. x≥52
D. x ≤ −5/2
Answer: D x ≤ −5/2
57. Solve the system of inequalities x − 2 > 0 , 3x < 18

A. 3 < x < 18
B. -6 < x < -2
C. 2 < x < 6
D. 1 < x < 3
Answer: C 2 < x < 6
58. Solve the system of inequalities − 4x + 1 ≥ 0 , 3 − 4x < 0
A. ( -2 , 3)
B. ( 1 , 3 )
C. no solution
D. ( - 4 , 3 )
Answer: C no solution
59. Solve the system of inequalities : x − 5 > 0, 2x−4x+2<2

A. x > 5
B. x > 2
C. none of these
D. x < − 2
Answer: A x > 5
60. Solve the system of inequalities: x+7x−8>2,2x+17x−1>5

A. (3, 6)
B. None of these
C. no solution
D. (2, 5)
Answer: A (3, 6)
61. Solve the system of inequalities − 2 ≤ 6x − 1 < 2

A. −16<x<32
B. none of these
C. −17≤x>12
D. −16≤x>12
Answer: D −16≤x>12
62. Solve the system of inequalities − 2 < 1 − 3x < 7

A. − 1 < x < 1
B. − 2 < x < 1
C. − 2 < x < 2
D. None of these
Answer: B − 2 < x < 1
63. Solve the system of inequalitie: −15<3(x−2)5≤0

A. −13 < x < 13
B. − 23 < x < 23
C. −13 < x < 2
D. − 23 < x ≤ 2
Answer: D − 23 < x ≤ 2
64. The solution set for | 3x − 2 | ≤ 1/2
A. [ 5/6 , 1/2 ]

B. none of these
C. [ 2/3 , 2/3 ]
D. [ 1/2 ,5/6 ]
Answer : D [ 1/2 ,5/6 ]
65. The solution set for | x | > 7
A. (−∞,−7)∪(7,∞)
B. ( 7 , ∞)
C. (−∞,−7)∩(7,∞)
D. none of these.
Answer: A (−∞,−7)∪(7,∞)
66. The solution set for : |x|−1|x|−2≥0,x≠±2

A. ( -2 , 2 )
B. (−∞,−2)∪(−1,1)∪(2,∞)
C. (−1,2)∪(3,∞)
D. (−∞,−2)∪(2,∞)
Answer: B (−∞,−2)∪(−1,1)∪(2,∞)
Rejected : Please rewrite statement wrong question.
67. The solution set for : ∣∣2(3−x)5∣∣<35

A. none of these
B. ( 3/2 , 9/2 )
C. (12,32)
D. (14,34)
Answer: B ( 3/2 , 9/2 )
68. Solve: 3x + 5 < x − 7, when x is a real number
A. x <−12
B. x > − 6
C. none of these
D. x < − 6
Answer: D x < − 6
69. The solution set of the inequation: 2x−13−3x5+1<0,x∈Wis:

A. x ∈N
B. none of these
C. null set
D. x ∈W
Answer: C Null set
70. The solution set of 6x − 1 > 5 is :
A. {x:x>1,x∈R}
B. none of these
C. {x:x<1,x∈N}
D. {x:x<1,x∈W}
Answer: A {x:x>1,x∈R}
71. If | x − 2|= p, where x < 2, then x - p =

A. -2
B. 2
C. 2p - 2
D. 2 – 2p
Answer: D 2 – 2p
72. A pack of coffee powder contains a mixture of x grams of coffee and y grams of choco.
The amount of coffee is greater than that of choco and each coffee powder pack is atmost
10 grams. Which of the following inequations describe the conditions given ?
A. None of these
B. x + y < 10 ; x < y
C. x + y ≤ 10 ; x > y
D. x + y < 12 ; x > y
Answer: C x + y ≤ 10 ; x > y
73. If a, b ,c are real numbers such that a > b , c > 0, then
A. ac > bc
B. ac < bc
C. ac ≥ bc
D. None of these
Answer: A ac > bc
74. If a , b , c are real numbers such that a ≥ b , c > 0, then

A. none of these
B. ac > bc
C. ac < bc
D. ac ≥ bc
Answer: D ac ≥ bc
75. Graph of the system of inequations x ≥ 0 , y ≤ 0 is

A. first quadrant
B. second quadrant
C. 4th quadrant
D. third quadrant
Answer: C 4th quadrant
76. In. L.P.P----
A. objective function is linear
B. constraints are linear
C. both objective function and constraints are linear
D. none of the above
Answer: C both objective function and constraints are linear
77. If the constraints in a linear programming problem are changed

A. the problem is to be re-evaluated
B. solution is not defined
C. the objective function has to be modified
D. the change in constraints is ignored.
Answer: A the problem is to be re-evaluated
78. Linear programming is a

A. constrained optimization technique
B. technique for economic allocation of limited resources
C. mathematical technique
D. all of the above
Answer: D all of the above
79. In Linear Programming, the most popular non graphical procedure is classified as
A. Linear procedure
B. Graphical procedure
C. Non- Graphical procedure
D. Simplex method
Answer: D Simplex method
Difficulty Level: HIgh
80. In Linear Programming, the term which states the value of objective function
improvement is classified as
A. State Function
B. Improvement Function
C. Better Programmed
D. Best
Answer: C Better Programmed
81. The Non basic Variable which is used to replace the basic variable is the variable which
has
A. Most Positive Column
B. Most Negative Column
C. Most Positive Row
D. Most Negative Row
Answer: D Most Negative Row
82. In the Linear Programming Problems, The Set of basic variables which are appeared in
the linear problem consist of
A. Slake and real variable
B. Slake and artificial variable
C. Departing the basic variable
D. Departing the non basic variable
Answer: B Slake and artificial variable
83. In linear programming, the number of requirements must be satisfied in simplex
method are
A. Two Requirements
B. Three Requirements
C. Four Requirements
D. Five Requirements
Answer: B Three Requirements
84. In linear programming, the constraints can be represented by

A. Equalities
B. Inequalities
C. Ratio
D. Both A & B
Answer: D Both A & B
85. The one Subset which satisfies the inequality part of equation is graphically
represented by
A. Domain Area of Y intercept
B. Range area of x intercept
C. Straight Lines
D. Shared area around straight line
Answer: D Shared area around straight line
86. If there is no significant in the item quality supplied by different sources then it is
classified as
A. homogeneous
B. Heterogeneous
C. Indifferent Items
D. Different Item
Answer: A homogeneous
87. One of the two subsets of solution set, one subset satisfy the equality part of equation
and other subset solves
A. Range part of equation
B. Domain part of equation
C. Equality part of equation
D. In-Equality part of equation
Answer: D In-Equality part of equation
88. For Linear inequalities, the solution set for a group of inequalities is classified as
A. Concave set
B. Convex set
C. Loss set
D. Profit Set
Answer: B Convex set
89. A constraint in an LP model restricts

A. value of objective function
B. value of a decision variable
C. use of the available resources
D. all of the above
90. The distinguishing feature of an LP model is

A. relationship among all variables is linear
B. it has single objective function & constraints
C. value of decision variables is non-negative
D. all of the above
Answer: A relationship among all variables is linear
91. The best use of linear programming technique is to find an optimal use of
A. money
B. manpower
C. machine
D. all of the above
Answer: B manpower
Which of the following is not a characteristic of the LP

A. resources must be limited
B. only one objective function
C. parameters value remains constant during the planning period
D. the problem must be of minimization type
Answer: D the problem must be of minimization type
92. Which of the following is an assumption of an LP model
A. divisibility
B. proportionality
C. additivity
D. all of the above
93. Which of the following is a limitation associated with an LP model

A. the relationship among decision variables in linear
B. no guarantee to get integer valued solutions
C. no consideration of effect of time & uncertainty on lp model
D. all of the above

Mcq’s Type: Conceptual
94. The Feasible region’s Optimal for a linear objective function always include
A. Downward Point
B. Upward Point
C. Corner Point
D. Front Point
Answer: C Corner Point
95. The Objective Function set solution containing points which has no bound over it is
considered as
A. Multiple Point Solution
B. Single Point Solution
C. Unbounded solution
D. Bounded Solution
Answer: C Unbounded solution
96. In Profit Objective Function, All the lines representing the same level of profit is
classified as
E. Iso objective Lines
F. Iso Function Lines
G. Iso profit Lines
H. Iso Cost Lines
Answer: C Iso profit Lines
97. In Profit Objectives such as minimizing the total transportation cost and total delivery
are classified as
A. Ordination Model
B. Transportation Model
C. Destination Model
D. Origins Model
Answer: B Transportation Model
98. Operation research approach is

A. multi-disciplinary
B. artificial
C. intuitive
D. all of the above
99. Operation research analysis does not

A. predict future operation
B. build more than one model
C. collect the relevant data
D. recommended decision and accept
Answer: A predict future operation
100. A constraint in an LP model restricts

A. value of the objective function
B. value of the decision variable
C. use of the available resources
D. all of the above
101. A feasible solution of LPP

A. must satisfy all the constraints simultaneously
B. need not satisfy all the constraints, only some of them
C. must be a corner point of the feasible region
D. all of the above
Answer: A must satisfy all the constraints simultaneously
102. Maximization of objective function in LPP means
A. value occurs at allowable set decision
B. highest value is chosen among allowable decision
C. none of the above
D. all of the above
Answer: B highest value is chosen among allowable decision
103. Alternative solution exist in a linear programming problem when

A. one of the constraint is redundant
B. objective function is parallel to one of the constraints
C. two constraints are parallel
D. all of the above
104. The linear function of the variables which is to be maximize or minimize is called
A. constraints
B. objective function
C. decision variable
Answer: B objective function
105. The true statement for the graph of inequations 3x+2y≤6 and 6x+4y≥20 , is
A. both graphs are disjoint
B. both do not contain origin
C. both contain point (1, 1)
D. none of these
Answer: A both graphs are disjoint
106. The value of objective function is maximum under linear constraints

A. at the center of feasible region
B. at (0,0)
C. at any vertex of feasible region
D. the vertex which is at maximum distance from (0, 0)
Answer: C at any vertex of feasible region
107. A model is
A. an essence of reality
B. an approximation
C. an idealization
D. all of the above
108. The first step in formulating a linear programming problem is

A. identify any upper or lower bound on the decision variables
B. state the constraints as linear combinations of the decision variables
C. understand the problem
D. identify the decision variables
Answer: D identify the decision variables
109. Constraints in an LP model represents

A. limitations
B. requirements
C. balancing, limitations and requirements
D. all of above
Answer: D all of above
110. The best use of linear programming is to find optimal use of

A. money
B. manpower
C. machine
D. all the above
Answer: D all the above
111. Which of the following is assumption of an LP model

A. divisibility
B. proportionality
C. additivity
D. all of the above
Rejected : This mcq is repeat.
112. Before formulating a formal LP model, it is better to

A. express each constraints in words
B. express the objective function in words
C. verbally identify decision variables
D. all of the above
113. Non-negative condition in an LP model implies

A. a positive coefficient of variables in objective function
B. a positive coefficient of variables in any constraint
C. non-negative value of resource
Answer: C non-negative value of resource
114. The set of decision variable which satisfies all the constraints of the LPP is called as----
A. solution
B. basic solution
C. feasible solution
Answer: A solution
115. The intermediate solutions of constraints must be checked by substituting them back
into
A. objective function
B. constraint equations
C. not required
Answer: B constraint equations
116. A basic solution is called non-degenerate, if

A. all the basic variables are zero
B. none of the basic variables is zero
C. at least one of the basic variables is zero
D. none of these
Answer: B none of the basic variables is zero
117. The graph of x≤2 and y≥2 will be situated in the

A. first and second quadrant
B. second and third quadrant
C. first and third quadrant
D. third and fourth quadrant
Answer: B second and third quadrant

118. A solution which satisfies non-negative conditions also is called as-----

A. solution
B. basic solution
Answer: C feasible solution
119. A solution which optimizes the objective function is called as ------

A. solution
B. basic solution
D. optimal solution
Answer: D optimal solution
120. The graphical method of LP problem uses

A. objective function equation
B. constraint equations
C. linear equations
D. all of the above
121. A feasible solution to an LP problem
A. must satisfy all of the problem’s constraints simultaneously
B. need not satisfy all of the constraints, only some of them
C. must be a corner point of the feasible region
D. must optimize the value of the objective function
Answer: A. must satisfy all of the problem’s constraints simultaneously
122. An iso-profit line represents

A. an infinite number of solutions all of which yield the same profit
B. an infinite number of solution all of which yield the same cost
C. an infinite number of optimal solutions
D. a boundary of the feasible region
Answer: D a boundary of the feasible region
123. If an iso-profit line yielding the optimal solution coincides with a constraint line, then
A. the solution is unbounded
B. the solution is infeasible
C. the constraint which coincides is redundant
Answer: A the solution is unbounded
124. A constraint in an LP model becomes redundant because

A. two iso-profit line may be parallel to each other
B. the solution is unbounded
C. this constraint is not satisfied by the solution values
Answer: A two iso-profit line may be parallel to each other
125. Constraints in LP problem are called active if they

A. represent optimal solution
B. at optimality do not consume all the available resources
C. both a & b
Answer: A represent optimal solution
126. Mathematical model of Linear Programming is important because

A. It helps in converting the verbal description and numerical data into mathematical expression
B. decision makers prefer to work with formal models.
C. it captures the relevant relationship among decision factors.
D. it enables the use of algebraic techniques.
Answer: A It helps in converting the verbal description and numerical data into mathematical
expression
127. In graphical method of linear programming problem if the iOS-cost line coincide with
a side of region of basic feasible solutions we get
A. Unique optimum solution
B. unbounded optimum solution
C. no feasible solution
D. Infinite number of optimum solutions
Answer: D Infinite number of optimum solutions
128. If the value of the objective function 𝒛 can be increased or decreased indefinitely, such
solution is called
A. Bounded solution
B. Unbounded solution
C. Solution
D. None of the above
Answer: B Unbounded solution
129. For the constraint of a linear optimizing function z=x1+x2 given by x1+x2 ≤1, 3x1+x2 ≥3
and x1, x2≥0
A. There are two feasible regions
B. There are infinite feasible regions
C. There is no feasible region
D. None of these
Answer: C There is no feasible region
130. If the number of available constraints is 3 and the number of parameters to be

optimized is 4, then
A. The objective function can be optimized
B. The constraints are short in number
C. The solution is problem oriented
D. The solution is not problem oriented
Answer: B The constraints are short in number

131. Non-negativity condition is an important component of LP model because

A. Variables value should remain under the control of the decision-maker
B. Value of variables make sense & correspond to real-world problems
C. Variables are interrelated in terms of limited resources
D. None of the above
Answer: B Value of variables make sense & correspond to real-world problems
132. Maximization of objective function in an LP model means

A. Value occurs at allowable set of decisions
B. Highest value is chosen among allowable decisions
C. Neither of above
D. Both a & b
Answer: D Both a & b
133. Which of the following is not a characteristic of the LP model

A. Alternative courses of action
B. An objective function of maximization type
C. Limited amount of resources
D. Non-negativity condition on the value of decision variables.
Answer: A Alternative courses of action
134. Which of the following statements is true with respect to the optimal solution of an LP
problem
A. Every LP problem has an optimal solution
B. Optimal solution of an LP problem always occurs at an extreme point
C. At optimal solution all resources are completely used
D. If an optimal solution exists, there will always be at least one at a corner
Answer: Every LP problem has an optimal solution
135. While plotting constraints on a graph paper, terminal points on both the axes are
connected by a straight line because
A. The resources are limited in supply
B. The objective function as a linear function
C. The constraints are linear equations or inequalities
D. All of the above
Answer: D All of the above
136. Maximize Z = – x + 2y, subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥

0.
A. Maximum Z = 12 at (2, 6)
B. Z has no maximum value
C. Maximum Z = 10 at (2, 6)
D. Maximum Z = 14 at (2, 6)
Answer: C Maximum Z = 10 at (2, 6)
Rejected : Please give complete solution in logical reasoning.
137. Which of the following is a point of feasible region determined by the linear in
equation 2 x+3 y ≤ 6 and 3 x−2 y ≤ 16
A. (4, -3)
B. (-2, 4)
C. (3, -2)
D. (3, -4)
Answer: C (3, -2)
138. Maximize Z = 3x + 4y Subject to the constraints: x + y ≤ 4, x ≥ 0, y ≥ 0

A. 16 at the point B (0, 4)
B. 16 at the point B (1, 4)
C. 16 at the point B (2, 4)
D. 16 at the point B (4, 4)
Answer: A 16 at the point B (0, 4)
139. Minimize Z = −3x + 4y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0

A. −12 at the point (2, 0)
B. −12 at the point (5, 0)
C. −12 at the point (6, 0)
D. −12 at the point (4, 0)
Answer: D −12 at the point (4, 0)
140. Maximize Z = 5x + 3y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0

A. 235/23 at the point (20/19, 45/19)
B. 235/12 at the point (20/19, 45/19)
C. 235/19 at the point (20/19, 45/19)
D. 235/11 at the point (20/19, 45/19)
Answer: C 235/19 at the point (20/19, 45/19)
141. Minimize Z = 3x + 5y such that x + 3y ≥ 3, x + y ≥ 2, x ≥ 0, y ≥ 0

A. 7 at (3/7, 1/2)
B. 7 at (3/2, 1/2)
C. 7 at (3/4, 1/2)
D. 7 at (3/3, 1/2)
Answer: B 7 at (3/2, 1/2)
142. Maximize Z = 3x + 2y subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.

A. 18 at the point (3, 3)
B. 18 at the point (2, 3)
C. 18 at the point (1, 3)
D. 18 at the point (4, 3)
Answer: D 18 at the point (4, 3)
143. Minimize Z = x + 2y subject to 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, y ≥ 0.

A. x + 2y = 6
B. x - 2y = 6
C. x +y=6
D. x+y=6
Answer: A x + 2y = 6
144. Minimize and Maximize Z = 5x + 10y subject to x + 2y ≤ 120, x + y ≥ 60, x − 2y ≥ 0, x ≥

0, y ≥ 0.
A. (122, 0) and (40, 30)
B. (121, 0) and (30, 30)
C. (120, 0) and (60, 30)
D. (110, 0) and (20, 30)
Answer: C (120, 0) and (60, 30)
______________________________________________________________________________
145. Objective function is Z = - x + 2 y …………………… (1).

The given constraints are : x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Corner points Z = - x + 2y
Here , the open half plane has points in common with the feasible region.
Therefore, Z has no maximum value.
Rejected : Wrong Mcq
146. A linear programming problem is one that is concerned with
A. finding the upper limits of a linear function of several variables

B. finding the lower limit of a linear function of several variables
C. finding the limiting values of a linear function of several variables
D. finding the optimal value (maximum or minimum) of a linear function of several
variables
Answer: D finding the optimal value (maximum or minimum) of a linear function of
several variables

Solution:
A linear programming problem is one that is concerned with finding the optimal value
(maximum or minimum) of a linear function of several variables.
147. Which of the following types of problems cannot be solved by linear

programming methods
A. Diet problems
B. Transportation problems
C. Manufacturing problems
D. Traffic signal control
Answer: B Transportation problems
Traffic signal control types of problems cannot be solved by linear programming methods.
148. The optimal value of the objective function Z = ax + by may or may not exist, if
the feasible region for a LPP is
A. a circle
B. a polygon
C. Bounded
D. Unbounded
Answer: C Bounded
The optimal value of the objective function Z = ax + by may or may not exist, if the
feasible region for a LPP is unbounded.
149. In a LPP, the objective function is always
A. cubic
B. quadratic
C. Linear
D. constant
Answer: B Linear
Solution:
In a LPP, the objective function is always linear.
150. In linear programming feasible region (or solution region) for the problem is
A. The common region determined by all the constraints including the non – negative
constraints x ⩾ 0, y⩾ 0
B. The common region determined by all the x ⩾ 0 and the objective function
C. The common region determined by all the objective functions including the non –
negative constraints x ⩾ 0, y ⩾ 0
D. The common region determined by all the x ⩾ 0, y ⩾ 0 and the objective function
Answer: A The common region determined by all the constraints including the non –
negative constraints x ⩾ 0, y⩾ 0
In linear programming feasible region (or solution region) for the problem is given by The
common region determined by all the constraints including the non – negative constraints
x ⩾0, y ⩾ 0
151. The maximum value of the object function Z = 5x + 10 y subject to the constraints x +
2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0 is
(a) 300
(b) 600
(c) 400
(d) 800
Answer: B 600

152. The maximum value of Z = 4x + 2y subject to the constraints 2x + 3y ≤ 18, x + y ≥ 10,

x, y ≤ 0 is
(a) 36
(b) 40
(c) 30
(d) None of these
Answer: D None of these

Logical Reasoning (If applicable): Not Applica
153. In equation 3x – y ≥ 3 and 4x – 4y > 4

(a) Have solution for positive x and y
(b) Have no solution for positive x and y
(c) Have solution for all x
(d) Have solution for all y
Answer: A Have solution for positive x and y

154. The maximum value of Z = 3x + 4y subjected to constraints x + y ≤ 40, x + 2y ≤ 60, x ≥

0 and y ≥ 0 is
(a) 120
(b) 140
(c) 100
(d) 160
Answer: B 140

155. Maximize Z = 11 x + 8y subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0.

(a) 44 at (4, 2)
(b) 60 at (4, 2)
(c) 62 at (4, 0)
(d) 48 at (4, 2)
Answer: B 60 at (4, 2)

156. Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0

(a) 20 at (1, 0)
(b) 30 at (0, 6)
(c) 37 at (4, 5)
(d) 33 at (6, 3)
Answer: C 37 at (4, 5)

157. Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0

(a) 16 at (4, 0)
(b) 24 at (0, 4)
(c) 24 at (6, 0)
(d) 36 at (0, 6)
Answer: D 36 at (0, 6)

158. Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0
(a) 59 at (92, 52)
(b) 42 at (6, 0)
(c) 49 at (7, 0)
(d) 57.2 at (0, 5.2)
Answer: A 59 at (92, 52)
159. Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0

(a) 12 at (2, 0)
(b) 1403 at (23, 13)
(c) 16 at (2, 1)
(d) 4 at (0, 1)

160. Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5

(a) 80 at (3, 2)
(b) 75 at (0, 3)
(c) 30 at (3, 0)
(d) 95 at (2, 3)

161. Z = 20x1 + 202, subject to x1 ≥ 0, x2 ≥ 0, x1 + 2x2 ≥ 8, 3x1 + 2x2 ≥ 15, 5x1 + 2x2 ≥ 20. The
minimum value of Z occurs at
(a) (8, 0)
(b) (52, 154)
(c) (72, 94)
(d) (0, 10)
Answer: C (72, 94)

162. Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum

value of Z occurs at
(a) (4, 0)
(b) (28, 8)
(c) (2, 72)
(d) (0, 3)
Answer: C (2, 72)
163. Refer to Question 18 maximum of Z occurs at

(a) (5, 0)
(b) (6, 5)
(c) (6, 8)
(d) (4, 10)
Answer: A (5, 0)

Rejected : Please do not give reference to previous questions. Write complete statement.
164. Refer to Question 18 (Maximum value of Z+ Minimum value of Z) is equal to

(a) 13
(b) 1
(c) -13
(d) -17
Answer: (d) -17

Rejected : Please do not give reference to previous questions. Write complete statement.
165. Z = 20x1 + 20x2, subject to x1 ≥ 0, x2 ≥ 0, x1 + 2x2 ≥ 8, 3x1 + 2x2 ≥ 15, 5x1 + 2x2 ≥ 20. The
minimum value of Z occurs at
(a) (8, 0)
(b) (52,154)
(c) (72,94)
(d) (0, 10)
Answer: C (72,94)
166. Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs
at
(a) (3, 0)
(b) (12,52)
(c) (7, 0)
(d) (0, 5)
Answer: D (0, 5)
167. Minimize Z = 20x1 + 9x2, subject to x1 ≥ 0, x2 ≥ 0, 2x1 + 2x2 ≥ 36, 6x1 + x2 ≥ 60.
(a) 360 at (18, 0)
(b) 336 at (6, 4)
(c) 540 at (0, 60)
(d) 0 at (0, 0)
Answer: B 336 at (6, 4)
168. Z = 8x + 10y, subject to 2x + y ≥ 1, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0. The minimum value

of Z occurs at
(a) (4.5, 2)
(b) (1.5, 4)
(c) (0, 7)
(d) (7, 0)
Answer: B (1.5, 4)

169. Z = 4x1 + 5x2, subject to 2x1 + x2 ≥ 7, 2x1 + 3x2 ≤ 15, x2 ≤ 3, x1, x2 ≥ 0. The minimum
value of Z occurs at
(a) (3.5, 0)
(b) (3, 3)
(c) (2,2)
(d) (2, 3)
Answer: A (3.5, 0)

170. The maximum value of f = 4x + 3y subject to constraints x ≥ 0, y ≥ 0, 2x + 3y ≤ 18; x +

y ≥ 10 is
(a) 35
(b) 36
(c) 34
(d) none of these
Answer: B 36

171. Objective function of a L.P.P.is

(a) a constant
(b) a function to be optimized
(c) a relation between the variables
(d) none of these
Answer: B a function to be optimized

172. The optimal value of the objective function is attained at the points
(a) on X-axis
(b) on Y-axis
(c) which are comer points of the feasible region
(d) none of these
Answer: C which are comer points of the feasible region

173. In solving the LPP:

“minimize f = 6x + 10y subject to constraints x ≥ 6, y ≥ 2, 2x + y ≥ 10, x ≥ 0, y ≥ 0”
redundant constraints are
(a) x ≥ 6, y ≥ 2
(b) 2x + y ≥ 10, x ≥ 0, y ≥ 0
(c) x ≥ 6
(d) none of these
Answer: B 2x + y ≥ 10, x ≥ 0, y ≥ 0

174. Region represented by x ≥ 0, y ≥ 0 is

(a) first quadrant
(b) second quadrant
(c) third quadrant
(d) fourth quadrant
Answer: A first quadrant

175. The region represented by the inequalities x ≥ 6, y ≥ 2, 2x + y ≤ 0, x ≥ 0, y ≥ 0 is

(a) unbounded
(b) a polygon
(c) exterior of a triangle
(d) None of these
Answer: D None of these

176. The minimum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5 + 2y ≥

200, 2y ≥ 80; x, y ≥ 0 is
(a) 220
(b) 300
(c) 230
(d) none of these
Answer: A 220

177. The maximum value of Z = 3x + 2y, subjected to x + 2y ≤ 2, x + 2y ≥ 8; x, y ≥ 0 is

(a) 32
(b) 24
(c) 40
(d) none of these
Answer: B 24

178. Maximize Z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x ≥ 0, y ≥ 0.

(a) 44 at (4, 2)
(b) 60 at (4, 2)
(c) 62 at (4, 0)
(d) 48 at (4, 2)
Answer: B 60 at (4, 2)

179. The feasible, region for an LPP is shown shaded in the figure. Let Z = 3x – 4y be the
objective function. A minimum of Z occurs at
(a) (0, 0)
(b) (0, 8)
(c) (5, 0)
(d) (4, 10)
Answer: B (0, 8)

Rejected : You mentioned about figure in question but there is no figure.
180. The feasible region for an LPP is shown shaded in the following figure. Minimum of Z
= 4x + 3y occurs at the point
(a) (0, 8)
(b) (2, 5)
(c) (4, 3)
(d) (9, 0)
Answer: B (2, 5)
Rejected : You mentioned about figure in question but there is no figure.
181. Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.

(a) 20 at (1, 0)
(b) 30 at (0, 6)
(c) 37 at (4, 5)
(d) 33 at (6, 3)

182. Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.

(a) 16 at (4, 0)
(b) 24 at (0, 4)
(c) 24 at (6, 0)
(d) 36 at (0, 6)

183. Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.

(a) 12 at (2, 0)
(b) 1403 at (23, 13)
(c) 16 at (2, 1)
(d) 4 at (0, 1)
184. Maximize Z = 10×1 + 25×2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.

(a) 80 at (3, 2)
(b) 75 at (0, 3)
(c) 30 at (3, 0)
(d) 95 at (2, 3)

185. Objective function of a LP problem is
(a) a constant
(b) a function to be optimized
(c) an inequality
(d) a quadratic equation
Answer: A a constant
_________________________________________________________________________
186. Which of the following statements is correct ?
(a) Every LP problem has at least one optimal solution.
(b) Every LP problem has a unique solution.
(c) If an LP problem has two optimal solutions, then it has infinitely many solutions.
(d) If a feasible region is unbounded then LP problem has no solution

Answer: C
________________________________________
187. A feasible solution to an LP problem,
(a) must satisfy all of the problem’s constraints simultaneously.
(b) need not satisfy all of the constraints, only some of them.
(c) must be a corner point of the feasible region.
(d) must optimize the value of the objective function.
Answer: A
Rejected : Mcq is repeat.
_______________________________________________________________________________
188. For the LP problem Minimize z = 2x + 3y the coordinates of the corner points of the bounded
feasible region are A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z is
(a) 49
(b) 15
(c) 10
(d) 05
Answer: B
_________________________________________________________________________________
189. Corner points of the bounded feasible region for an LP problem are (0, 4), (6, 0), (12, 0), (12, 16)
and (0, 10). Let z=8x + 12y be the objective function. Match the following:
(i) Minimum value of z occurs at _____ (ii) Maximum value of z occurs at _____
(iii) Maximum of z is _____ (iv) Minimum of z is _____
(a) (i) (6, 0) (ii) (12, 0) (iii) 288 (iv) 48
(b) (i) (0, 4) (ii) (12, 16) (iii) 288 (iv) 48
(c) (i) (0, 4) (ii) (12, 16) (iii) 288 (iv) 96
(d) (i) (6, 0) (ii) (12, 0) (iii) 288 (iv) 96
Answer: B
_____________________________________________________________________________
190. The corners points of the feasible region determined by the system of linear constraints are
(0, 10), (5, 5) (15, 15), (0, 20). Let z= px + qy, where p, q > 0.Condition on p and q so that
the maximum of z occurs at both the points (15, 15) and (0, 20) is _____
(a) p=q
(b) p =2q
(c) q = 2p
(d) q = 3p
Answer: D
___________________________________________________________________________
191. Solution of following LP problem Maximize z = 2x + 6y subject to -x+ y ≤ 1, 2x + y ≤ 2 and
x ≥ 0, y ≥ 0 is
(a) 43
(b) 13
(c) 263
(d) no feasible Region
Answer: B
_______________________________________________________________________
192. Solution of following LP problem Minimize z =-3x + 2y subject to 0 ≤ x ≤ 4, 1 ≤ y ≤ 6, x + y ≤ 5 is
(A) -10
(B) 0
(C) 2
(D) 10
Answer: A
________________________________________
193. For the LP problem Minimize z= 2x+3y the coordinates of the corner points of the bounded
feasible region are A(3,3), B(20,3), C(20,10), D(18,12) and E(12,12). The minimum value of z is_____
(a) 49
(b) 15
(c) 10
(d) 05
Answer: A

________________________________________
194. How many of the following points satisfy the inequality 2x-3y>-5?
(1,1)(-1,1),(1,-1),(-1,-1),(-2,1)(2,-1),(-1,2) and (-2,-1)
(a) 3
(b) 5
(c) 6
(d) 4
Answer: B
________________________________________
195. Feasible region formed by the constraints x+y≤4, 3x+3y≥18, x≥0, y≥0 is_____
(a) Bounded
(b) Unbounded
(c) lies first and second quadrant
(d) does not exist
Answer: D does not exist
Logical Reasoning (If applicable): Not Applica
____________________________________________________________________________
196. The maximum value of z = 3x + 4y subject to the conditions x + y ≤ 4, x ≥ 0, y ≥ 0 is _____
(a) 0
(b) 12
(c) 16
(d) 28
Answer: C 16

____________________________________________________________________________
197. The maximum value of z = 3x + 4y subject to conditions x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0
is at _____ point and value is _____ .
(a) (0, 0), 0
(b) (2, 3), 18
(c) (0, 4), 16
(d) (4, 0),12
Answer: A
___________________________________________________________________________
198. The maximum value of z = -x + 2y subject to conditions x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 6 _____
(a) is 9
(b) is -2
(c) is 10
(d) cannot be found
Answer: D
___________________________________________________________________________
199. The minimum value of z = 200x + 500y subject to conditions x + 2y ≥ 10, 3x + 4y ≤ 24 and x ≥ 0, y ≥
0 Is _____
(a) 2300
(b) 2500
(c) 3000
(d) 200
Answer: C
________________________________________
The minimum value of z = 3x + 2y subject to conditions x + y ≥ 8, 3x + 5y ≤ 15, x ≥ 0, y ≥ 0 _____ .
(a) is 15
(b) is 6
(c) is 16
(d) has no feasible region
Answer: D
200. One kind of cake requires 300 g of flour and 15 g of fat. Another kind of cake requires 150 g of
flour and 30 g of fat. Assuming that there is no shortage of other ingredients used in making the cakes,
the maximum number of cakes that can be prepared from 7.5 kg of flour and 600 g of fat is _____
(a) 20
(b) 25
(c) 30
(d) 40
Answer: C
201. Which of the following statement is correct ?
(a) Every linear programming problem has at least one optimal solution.
(b) Every linear programming problem has a unique optimal solution.
(c) If a linear programming problem has two optimal solutions, then it has infinitely many solutions.
(d) If a feasible region is unbounded, then linear programming problem has no solution.
Answer: C
______________________________________________________________________________
202. In solving the linear programming problem : "Minimize z = 6x + 10y subject to
x ≥ 6, y ≥ 2, 2x + y ≥ 10, x ≥ 0, y ≥ 0." Redundant constraints are _____
(a) x ≥ 6, y ≥ 2
(b) 2x + y ≥ 10, x ≥ 0, y ≥ 0
(c) x≥6
(d) x ≥ 6, y ≥ 0
Answer: B
Rejected : Please give complete solution in logical reasoning. Mentioned difficulty level. Write answer
with correct option.
_________________________________________________________________________
203. A feasible solution to a linear programming problem, _____
(a) must satisfy all of the problem's constraints simultaneously
(b) need not satisfy all of the constraints, only some of them
(c) must be a corner point of the feasible region
(d) must optimize the value of the objective function
Answer: A
Difficulty Level: Low
___________________________________________________________________________
204. The corner points of the feasible region determined by the system of linear constraints are (0,
15), (15, 15), (25, 25), (10, 35), (10, 0). Let z = px + qy, where p, q > 0. Condition on p and q so that the
maximum of z occurs at both the points (25, 25) and (10, 35) is _____
(a) 3p = q
(b) p = 2q
(c) 2p = 3q
(d) 3p = 2q
Answer: D
____________________________________________________________________________
205. For the linear programming problem : Minimize z = 4x + 5y, the co-ordinates of the
corner points of the bounded feasible region are A (10, 10), B (20, 5), C (2, 17), D (16, 11)
and E (17, 5). The minimum value of z is _____ .
(a) 80
(b) 90
(c) 93
(d) 105
Answer: B
______________________________________________________________________________
206. Solution of the following linear programming problem : Maximize z = 5x + 6y subject to

y ≤ 2x + 1, 5x + 2y ≤ 20 and x ≥ 0, y ≥ 0 _____ .
(a) is 6
(b) is 20
(c) is 40
(d) has no feasible region
Answer: C
______________________________________________________________________________
207. The corner points of the feasible region determined by the system of linear constraints
are (0, 10), (5, 5), (15, 15), (0, 20). Suppose z = px + 3y, where p > 0. If the maximum of z occurs at
both the points (15, 15) and (0, 20), then p = _____
(A) 4
(b) 5
(c) 1
(d) 2
Answer: c
______________________________________________________________________________
208. The co-ordinates of the corner points of the bounded feasible region are (3, 3), (20, 3), (20, 10),
(18, 12) and (12, 12). The minimum value of an objective function z = 2x + 3y occurs at corner point
_____
(a) (18, 12)
(b) (12, 12)
(c) (20, 10)
(d) (3, 3)
Answer: c
______________________________________________________________________________
The position of points O (0, 0) and P (2, -3) in the region of graph of in equation 2x - 3y < 5 will be
_____
(a) O inside and P outside
(b) O and P both inside
(c) O and P both outside
(d) O outside and P inside
Answer: A
______________________________________________________________________
Topic: Linear Inequality
Mcq’s Type: Problem Solving
x−3
209. Solve the following inequality: >0
x+7
a) x < −7, x > 3

b) y > -4
c) x < 8, x > 4
d) y=4
Answer: A x < −7, x > 3
210. What is the solution set for ∣∣2x−1x−1∣∣>2 ?

A. (−34,1)∪(1,∞)
B. (14,1)∪(1,∞)
C. None of these
D. (34,1)∪(1,∞)
Answer : D (34,1)∪(1,∞)
Rejected : Mcq is not correct.
211. In the first three papers each of 100 marks , Rishi got 95 , 72 , 83 marks . If he wants
an average of greater than or equal to 75 marks and less than 80 marks, find the range of
marks he should score in the 4th paper .
A. 25 < × < 75

B. 75 < × < 80
C. 73 < × < 100
D. 50 ≤ x < 70
Answer : D 50 ≤ x < 70
212. A man wants to cut three lengths from a single piece of board of length 91 cm. The
second length is to be 3 cm longer than the shortest and third length is to be twice as long
as the shortest. What are the possible lengths for the shortest board if the third piece is to
be at least 5 cm longer than the second?
A. 5 ≤ × ≤ 91
B. 8 ≤ × ≤ 22
C. 3 ≤ × ≤ 91
D. 3 ≤ × ≤ 5
Answer : B 8 ≤ × ≤ 22
213. Find all pairs of consecutive odd natural numbers, both of which are larger than 10,
such that their sum is less than 40.
A. ( 11 , 13 ) , ( 13 , 15 ) , ( 17 , 19 ) , ( 19 , 21 )
B. ( 11 , 13 ) , ( 13 , 15 ) , ( 15 , 17 ) , ( 17 , 19 )
C. ( 11 , 13 ) , ( 13 , 15 ) , ( 15 , 17 ) , ( 17 , 21 )
D. ( 9 , 11 ) , ( 13 , 15 ) , ( 15 , 17 ) , ( 17 , 19 )
Answer : B ( 11 , 13 ) , ( 13 , 15 ) , ( 15 , 17 ) , ( 17 , 19 )
214. The marks scored by Rohit in two tests were 65 and 70. Find the minimum marks he
should score in the third test to have an average of at least 65 marks.
A. 70
B. 75
C. 65
D. 60
Answer: D 60
215. A solution is to be kept between 30∘C and 35∘C What is the range of temperature in

degree Fahrenheit. What is the range of temperature in degree Fahrenheit if conversion
formula is given by C=59(F−32) where C and F represent temperature in degree Celsius
and degree Fahrenheit?
A. Between 76oF and 105oF
B. Between 86oF and 95oF
C. Between 30oF and 35oF
D. Between 40oF and 60oF
Answer: B Between 86oF and 95oF
216. The longest side of a triangle is three times the shortest side and the third side is 2cm
shorter than the longest side if the perimeter of the triangles at least 61cm, find the
minimum length of the shortest side.
A. 61cm
B. 11cm
C. 16cm
D. 9cm
Answer : D 9cm
Rejected : Give logical reasoning.
217. Given that x is an integer, find the values of x which satisfy both 2x + 3 > 7 and x + 4 <
10
A. 4
B. 4 , 5
C. 3 , 4 , 5
D. 3
Answer : C 3 , 4 , 5

218. The solution for the simultaneous linear inequalities 2x − 3 ≤ 7 and − x ≤ 2 is :
A. − 5 ≤ x ≤ − 2
B. − 1 < x ≤ 2
C. − 2 ≤ x ≤ 5
D. None of these
Answer: C − 2 ≤ x ≤ 5
219. Given that x is an integer, find the values of x which satisfy the simultaneous linear
inequalities 2 + x < 6 and 2−3x < − 1.
A. 1 , 2, 3, 4.
B. 1 , 2 , 3
C. 2 , 3, 4,
D. 2 , 3
Answer: D 2 , 3
220. Solve the system of inequalities 4x + 3 ≥ 2x + 17 , 3x − 5 < − 2

A. no solution
B. ( -2 , 2 )
C. (−32,25)
D. (−4,12)
Answer: A no solution
221. Solve the system of inequalities (x + 5 ) − 7 ( x − 2 ) ≥ 4x + 9 , 2 ( x − 3 ) − 7 ( x + 5 ) ≤ 3x

−9
A. − 4 ≤ x ≤ 1
B. − 4 ≤ x ≤ 4
C. − 9/4 ≤ x ≤ 1
D. − 1 ≤ x ≤ 1
Answer: A − 4 ≤ x ≤ 1
222. Find all pairs of consecutive even positive integers, both of which are larger than 5,
such that their sum is less than 23.
A. none of these.
B. (3,5), (5,7),(7,9)
C. (4,6),(6,8),(8,10)
D. (6,8) ,(8,10) ,(10,12)
Answer: D (6,8) ,(8,10) ,(10,12)
Solution:
Let the consecutive even positive integers be x and x+2.

By data, x >5 and x +(x +2)< 23
Now x +(x +2)< 23

⇒ 2 x+ 2< 23⇒ 2 x <21 ⇒ x< 212=1012
So we have the least possible value of x is 6 and the maximum value of x is 10.
Therefore the possible pairs of consecutive even positive integers are (6,8) ,(8,10) ,(10,12).
_____________________________________________________________________
223. If x belongs to set of integers , A is the solution set of 2 ( x − 1 ) < 3x − 1 and B is the
solution set of 4x − 3 ≤ 8 + x, find A ∩B
A. { 0 ,1 ,2 }
B. { 1, 2 , 3 }
C. { 0 , 2 ,4 }
D. { 0, 1, 2, 3 }
Answer: D { 0, 1, 2, 3 }
224. The linear programming Model which involve the funds allocation of limited investment is
classified as
A. Ordination budgeting model

B. Capital budgeting Models
C. Funds Investment Model
D. Funds Origin Model
Answer: B Capital budgeting Models

225. The linear programming used to optimize mathematical procedure and is
A. Subset of mathematical programming

B. Dimension of mathematical programming
C. Linear mathematical programming
D. All of above
Answer: A Subset of mathematical programming

226. In linear programming, The objective function and objective constraints are
A. Linear
B. Solved
C. Quadratic
D. Adjacent
Answer: B Solved

227. Algebraic Statement a < b is equal to

A. a is less than b
B. a is not less than b
C. a is greater than b
D. A and B
Answer: A a is less than b

_____________________________________________________________________
228. Algebraic Statement a > b is equal to
A. a is less than b
B. a is not less than b
D. A and B
Answer: C a is greater than b

_____________________________________________________________________
229. Algebraic Statement a ≤ b is equal to
A. a is less than b
B. a is less than or equal to b
D. A and B
Answer: B a is less than or equal to b

_____________________________________________________________________
230. Algebraic Statement a ≥ b is equal to
A. a is less than b
B. a is less than or equal to b
C. a is greater than or equal to b
D. A and B
E. Answer: C a is greater than or equal to b
_____________________________________________________________________
231. Geometric statement ‘a lies to the left of b’ is equal to
A. a>b
B. ab
B. a b

_____________________________________________________________________
233. Geometric statement ‘a coincides with b or lies to the left of b’ is equal to
A. a>b
B. ab
B. ab
B. ab
B. a b

_____________________________________________________________________
237. Equalent Statement ‘a is less than or equal to b’ is equal to
A. a>b
B. ab
B. a 0
A. x>0
B. x<3
C. x≥4
D. x>5
Answer: D x > 5

_____________________________________________________________________
A. x>6
B. x<3
C. x≥4
D. x>5
Answer: A x > 6

_____________________________________________________________________

A. x>6
B. x > 10
C. x≥4
D. x>5
Answer: B x > 10

_____________________________________________________________________
242. Solve the inequality x -8 < 0
A. x>6
B. x > 10
C. x≥4
D. x<8
Answer: D x < 8

_____________________________________________________________________
243. Solve the inequality x -10 < 15
A. x < 15
B. x > 10
C. x≥4
D. x>5
Answer: A x < 15


Mcq’s Type: Problem Solving
244. Find the minimum and maximum values of the function f(x,y) = 2x + 3y subject to constraint
A. (0,14)
B. (0,10)
C. (0,15)
D. (0,12)
Answer: A (0,14)

_____________________________________________________________________
245. Find the minimum and maximum values of the function f(x , y) = 4x + 2y subject to constraint
A. (0,14)
B. (0,10)
C. (0,16)
D. (0,12)
Answer: C (0,16)

Rejected : Constraints are missing
_____________________________________________________________________
246. A furniture dealer deals with only two items,viz,tables,chairs. He has Rs. 10000 to invest and a
space to store at most 60 pieces. A tablw cost him Rs. 500 and chair Rs. 200. He can sell a table at a
profit of Rs. 50, and a chair at a profit of Rs. 15. Assumes that he can sell all the item that he buys.
Formulate this problem as on LLP, so that he can maximize the profit.
A. x ≥ 0, y≥ 0
B. x ≥ 0, y≥ 6
C. x ≥ 5, y≥ 0
D. x ≥ 2, y≥ 0
Answer: A x ≥ 0, y≥ 0

_____________________________________________________________________
247. A factory produces two types of foods containers A and B by using two machines M1 and M2 . to
produce container A, M1 works for 2 minutes and M2, 4 minutes. The profit for container A is Rs, 29
and Container B Rs.45. How many container of each type should be produced so that maximum profit
can be achieved?
A. (10 , 8)
B. (0,10)
C. (0,16)
D. (10,5)
Answer: D (10,5)

_____________________________________________________________________
248. A former possesses 80 acers of land and wish to grow to types of crops A and B, Cultivation of
crop A required 3 hours per acer and cultivation of crop B required 2 hours per acers. Working hours
can not accede 180hours. If he get a profit of Rs. 50 per acers for crop A and Rs. 40 per acers for crop
B. Then how many acers of each crop should be cultivated to maximize his profit.
A. (10 , 8)
B. (20,60)
C. (30,16)
D. (10,50)
Answer: B (20,60)

_____________________________________________________________________
249. How many steps are requires to procedure for determining the optimal solution.
A. 2
B. 4
C. 5
D. 7
Answer: B 4

_____________________________________________________________________
250. Determine the Feasible region by graphing the linear inequalities that form the.
A. Region
B. Equalities
C. Constraint
D. All of above
Answer: C Constraint

_____________________________________________________________________
251. Find the corner points of feasible region by solving two equations at a time of the boundry lines
of the
A. Feasible Region
B. Equalities
C. Constraint
D. All of above
Answer: A Feasible Region

_____________________________________________________________________
252. Compute the value of objective function f(x,y) = ax + by at each of the
A. Feasible Region
B. Corner Points
C. Constraint
D. All of above
Answer: A Feasible Region

Rejected : Please rewrite statement.
_____________________________________________________________________
253. The Mathematical formulation of linear programming problems involve the basic steps.
A. 2
B. 5
C. 7
D. 4
Answer: D 4

_____________________________________________________________________
254. Maximize 5x + 7y, Subject to the constraint 2x +3y ≤ 12, x + y ≤ 5, x ≥ 0 and y ≥ 0
A. 29
B. 30
C. 28
D. 31
Answer: B 30

_____________________________________________________________________
255. The maximum value of the function f = 5x + 3y subjected to the constraint x ≥ 3, y ≥ 3 is
A. 15
B. 9
C. 24
D. Not Exist
Answer: A 15

_____________________________________________________________________
256. The vertices of closed canvas polygon representing the feasible region of the objective function
are (6,2),(4,6),(5,4),(3,6). Find the maximum value of the function f = 7x + 11y
A. 64
B. 79
C. 94
D. 87
Answer: B 79

_____________________________________________________________________
257. Find the profit function P if it yields the value 11 and 7 at (3,7) and (1.3) respectively.
A. P= -8x + 5y
B. P= 8x - 5y
C. P= 8x + 5y
D. P= -(8x + 5y)
Answer: C P= 8x + 5y

_____________________________________________________________________
258. The solution of system of inequalities x ≥ 0, x – 5 ≤ and x ≥ y is polygonal region with the vertices
as
A. (0,0),(5,0),(5,5)
B. (0,0),(0,5),(5,5)
C. (5,5),(0,5),(5,5)
D. (0,0),(0,5),(5,0)
Answer: D (0,0),(0,5),(5,0)

_____________________________________________________________________
259. Two godowns A and B have grain capacity of 100 quintals and 50 quintals
respectively. They supply to 3 ration shops, D, E and F whose requirements are 60, 50
and 40 quintals respectively. The cost of transportation per quintal from the godowns
to the shops are given in the following table:
How should the supplies be transported in order that the transportation cost is minimum?
What is the minimum cost?
A. From A : 12,52, 40 units; From B: 50,0,0 units to D, E and F respectively and

minimum cost = Rs 530
B. From A : 10,52, 42 units; From B: 50,0,0 units to D, E and F respectively and

C. From A : 10,50, 40 units; From B: 50,0,0 units to D, E and F respectively and

D. From A : 10,53, 44 units; From B: 50,0,0 units to D, E and F respectively and

Answer:C From A : 10,50, 40 units; From B: 50,0,0 units to D, E and F respectively
and minimum cost = Rs 510

Let the number of units of grain transported from godown A to D = x And the
number of units of grain transported from godown A to E = y Therefore , the
number of units of grain transported from godown A to F = 100 – (x+y) Therefore ,
the number of units of grain transported from godown B to D = 60 – x The number
of units of grain transported from godown B to E = 50 – y The number of units of
grain transported from godown B to F = x + y – 60 . Here , the objective function is
:Minimise Z = 2.5x + 1.5y + 410 . , subject to constraints : 60 - x ≥ 0,50 - y ≥ 0 ,
100 – (x + y) ≥ 0 , (x + y) - 60 ≥ 0 , x,y ≥ 0.
Here Z = 510 is minimum.i.e. From A : 10,50, 40 units; From B: 50,0,0 units to D,

E and F respectively and minimum cost = Rs 510.
_____________________________________________________________________________
260. Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and
(0, 5). Let F = 4x + 6y be the objective function. Maximum of F – Minimum of F =
A. 60
B. 48
C. 42
D. 30
Answer: A 60
Here the objective function is given by : F = 4x +6y .
Maximum of F – Minimum of F = 72 – 12 = 60 .
______________________________________________________________________________
261. One kind of cake requires 200g of flour and 25g of fat, and another kind of cake
requires 100g of flour and 50g of fat. Find the maximum number of cakes which can
be made from 5kg of flour and 1 kg of fat assuming that there is no shortage of the
other ingredients used in making the cakes.
A. Maximum number of cakes = 30 , 20 of kind one and 10 cakes of another kind

B. Maximum number of cakes = 32 , 20 of kind one and 12 cakes of another kind
C. Maximum number of cakes = 34 , 27 of kind one and 7 cakes of another kind
D. Maximum number of cakes = 33 , 22 of kind one and 11 cakes of another kind
Answer: A Maximum number of cakes = 30 , 20 of kind one and 10 cakes of another kind
Let number of cakes of first type = x

And number of cakes of second type = y
Therefore , the above L.P.P. is given as :
Minimise , Z = x +y , subject to the constraints : 200x +100y ≤ 5000 and. 25x +50y ≤
1000, i.e. 2x + y ≤ 50 and x +2y ≤ 40 x, y ≥ 0.
i.e Maximum number of cakes = 30 , 20 of kind one and 10 cakes of another kind .
______________________________________________________________________________
262. An oil company has two depots A and B with capacities of 7000 L and 4000 L
respectively. The company is to supply oil to three petrol pumps, D, E and F whose
requirements are 4500L, 3000L and 3500L respectively. The distances (in km)
between the depots and the petrol pumps is given in the following table:
Assuming that the transportation cost of 10 litres of oil is Re 1 per km, how should
the delivery be scheduled in order that the transportation cost is minimum? What is
the minimum cost?
A. From A: 550, 3000 and 3500 litres; From B: 4000, 0, 0 litres to D, E and F
respectively; Minimum cost = Rs 4800
B. From A: 540, 3000 and 3500 litres; From B: 4000, 0, 0 litres to D, E and F
C. From A: 500, 3000 and 3500 litres; From B: 4000, 0, 0 litres to D, E and F
D. From A: 520, 3000 and 3500 litres; From B: 4000, 0, 0 litres to D, E and F
Answer: C
Here objective function is : Z = 3x + y + 39500 , subject to constraints : : x + y ≤ 7000, x

≤ 4500, x + y ≥ 3500, , y ≤ 3000x , x,y ≥ 0
Here Z = 4400 is minimum.i.e. . From A: 500, 3000 and 3500 litres; From B: 4000, 0, 0
litres to D, E and F respectively; Minimum cost = Rs 4400 .
__________________________________________________________________
263. Corner points of the feasible region determined by the system of linear
constraints are (0, 3), (1, 1) and (3, 0). Let Z = px+qy, where p, q > 0. Condition on p
and q so that the minimum of Z occurs at (3, 0) and (1, 1) is
A. p = 2q
B. p = q
C. p = 3q
D. p = q/2

We have Z = px + qy , At (3, 0) Z = 3p ……………………………….(1) At (1 , 1) Z = p +

q …………………………(2) Therefore , from (1) and (2) : We have : p = q/2 .
______________________________________________________________________________
264. In a LPP if the objective function Z = ax + by has the same maximum value on
two corner points of the feasible region, then every point on the line segment joining
these two points give the same
A. Minimum value
B. Mean value
C. Maximum value
D. Upper limit value
Answer: C. Maximum value

In a LPP if the objective function Z = ax + by has the same maximum value on two corner
points of the feasible region, then every point on the line segment joining these two points
give the same maximum value .
265. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours
of machine time and 3 hours of craftman’s time in its making while a cricket bat
takes 3 hour of machine time and 1 hour of craftman’s time. In a day, the factory has
the availability of not more than 42 hours of machine time and 24 hours of
craftsman’s time. What number of rackets and bats must be made if the factory is to
work at full capacity?
A. 5 tennis rackets and 15 cricket bats

B. 4 tennis rackets and 12 cricket bats
C. 4 tennis rackets and 14 cricket bats
D. 3 tennis rackets and 13 cricket bats
Answer: B. 4 tennis rackets and 12 cricket bats

Let number of rackets made = x

And number of bats made = y
Therefore, the above L.P.P. is given as :
Maximize , Z = x +y , subject to the constraints : 1.5x +3y ≤ 42 and. 3x +y ≤ 24, i.e.0.5x +
y ≤ 14 i.e. x +2y ≤ 28 and 3x +y ≤ 24 , x, y ≥ 0.
Here Z = 16 is maximum. I.e. Maximum number of rackets = 4 and number of bats = 12.
266. A fruit grower can use two types of fertilizer in his garden, brand P and brand
Q. The amounts (in kg) of nitrogen, phosphoric acid, potash, and chlorine in a bag of
each brand are given in the table. Tests indicate that the garden needs at least 240 kg
of phosphoric acid, at least 270 kg of potash and at most 310 kg of chlorine. If the
grower wants to minimize the amount of nitrogen added to the garden, how many
bags of each brand should be used? What is the minimum amount of nitrogen added
in the garden? should the delivery be scheduled in order that the transportation cost
is minimum?
A. 45 bags of brand P and 105 bags of brand Q; Minimum amount of nitrogen = 480
kg.
B. 40 bags of brand P and 100 bags of brand Q; Minimum amount of nitrogen = 470
kg.
C. 50 bags of brand P and 100 bags of brand Q; Minimum amount of nitrogen = 490
kg.
D. 47 bags of brand P and 107 bags of brand Q; Minimum amount of nitrogen = 499
kg.
Answer B. 40 bags of brand P and 100 bags of brand Q; Minimum amount of nitrogen =
470 kg.
Let the number of bags used for fertilizer of brand P = x And the number of bags used for
fertilizer of brand Q = y . Here , Z = 3x + 3.5y subject to constraints : :1.5 x +2 y ≤ 310, x
+ 2y ≥ 240, 3x + 1.5y ≥ 270 , x,y ≥ 0
Here Z = 470 is minimum i.e. 40 bags of brand P and 100 bags of brand Q; Minimum
amount of nitrogen = 470 kg.
__________________________________________________________________
267. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours
of machine time and 3 hours of craftman’s time in its making while a cricket bat
takes 3 hour of machine time and 1 hour of craftman’s time. In a day, the factory has
the availability of not more than 42 hours of machine time and 24 hours of
craftsman’s time. If the profit on a racket and on a bat is Rs 20 and Rs 10
respectively, find the maximum profit of the factory when it works at full capacity?
A. Maximum profit = Rs 220

B. Maximum profit = Rs 210
C. Maximum profit = Rs 200
D. Maximum profit = Rs 230
Answer: C Maximum profit = Rs 200
Let number of rackets made = x

And number of bats made = y
Therefore , the above L.P.P. is given as :
Maximise , Z = x +y , subject to the constraints : 1.5x +3y ≤ 42 and. 3x +y ≤ 24, i.e.0.5x +
y ≤ 14 i.e. x +2y ≤ 28 and 3x +y ≤ 24 , x, y ≥ 0.
Here Z = 16 is maximum. i.e Maximum number of rackets = 4 and number of bats = 12.
Here , profit function is P = 20x + 10y
Profit is maximum at x = 4 and y = 12 .
Therefore, maximum profit = 20(4) + 10 (12) = 200.i.e. Rs.200.
__________________________________________________________________
268. A fruit grower can use two types of fertilizer in his garden, brand P and brand
Q. The amounts (in kg) of nitrogen, phosphoric acid, potash, and chlorine in a bag of
each brand are given in the table. Tests indicate that the garden needs at least 240 kg
of phosphoric acid, at least 270 kg of potash and at most 310 kg of chlorine.
If the grower wants to maximize the amount of nitrogen added to the garden, how
many bags of each brand should be added? What is the maximum amount of nitrogen
added?
A. 150 bags of brand P and 50 bags of brand Q; Maximum amount of nitrogen = 625
kg
B. 160 bags of brand P and 52 bags of brand Q; Maximum amount of nitrogen = 635
kg
C. 140 bags of brand P and 50 bags of brand Q; Maximum amount of nitrogen = 595
kg
D. 145 bags of brand P and 55 bags of brand Q; Maximum amount of nitrogen = 555
kg
Answer: C
Let the number of bags used for fertilizer of brand P = x And the number of bags used for
fertilizer of brand Q = y . Here , Z = 3x + 3.5y subject to constraints : :1.5 x +2 y ≤ 310,
x + 2y ≥ 240, 3x + 1.5y ≥ 270 , x,y ≥ 0
Here Z = 595 is maximum i.e. 140 bags of brand P and 50 bags of brand Q; Maximum
amount of nitrogen = 595 kg .
269. Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a
LPP is shown in Figure.
A. 206
B. 226
C. 196
D. 216
Answer: C
270. In linear programming, optimal solution
A. satisfies all the constraints only

B. is not unique
C. satisfies all the constraints as well as the objective function
D. maximizes the objective function only
Answer: C satisfies all the constraints as well as the objective function

In linear programming, optimal solution satisfies all the constraints as well as the
objective function
_________________________________________________________________
271. In linear programming problems the optimum solution

A. satisfies a set of piecewise – linear inequalities (called constraints)
B. satisfies a set of linear inequalities (called linear constraints)
C. satisfies a set of quadratic inequalities (called constraints)
D. satisfies a set of cubic inequalities (called constraints)
E. Answer: B satisfies a set of linear inequalities (called linear constraints)

In linear programming problems the optimum solution satisfies a set of linear inequalities
(called linear constraints) .
272. A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A
and 3 hours on machine B to produce a package of nuts. It takes 3 hours on machine
A and 1 hour on machine B to produce a package of bolts. He earns a profit of
Rs17.50 per package on nuts and Rs 7.00 per package on bolts. How many packages
of each should be produced each day so as to maximise his profit, if he operates his
machines for at the most 12 hours a day?
A. 3 packages of nuts and 3 packages of bolts; Maximum profit = Rs 73.50.

B. 4 packages of nuts and 4 packages of bolts; Maximum profit = Rs 76.50.
C. 3 packages of nuts and 4 packages of bolts; Maximum profit = Rs 74.50.
D. 4 packages of nuts and 3 packages of bolts; Maximum profit = Rs 75.50.
Answer: A
Let number of packages of nuts produced = x

And number of packages of bolts produced = y
Therefore, the above L.P.P. is given as :
Maximize , Z = 17.50x +7y , subject to the constraints : x +3y ≤ 12 and. 3x +y ≤ 12, x, y ≥
0.
i.e 3 packages of nuts and 3 packages of bolts;
Maximum profit = Rs 73.50.
_________________________________________________________________
273. A toy company manufactures two types of dolls, A and B. Market tests and
available resources have indicated that the combined production level should not
exceed 1200 dolls per week and the demand for dolls of type B is at most half of that
for dolls of type A. Further, the production level of dolls of type A can exceed three
times the production of dolls of other type by at most 600 units. If the company
makes profit of Rs 12 and Rs 16 per doll respectively on dolls A and B, how many of
each should be produced weekly in order to maximize the profit?
A. 830 dolls of type A and 430 dolls of type B; Maximum profit = Rs 16300
B. 800 dolls of type A and 400 dolls of type B; Maximum profit = Rs 16000
C. 840 dolls of type A and 404 dolls of type B; Maximum profit = Rs 16500
D. 820 dolls of type A and 420 dolls of type B; Maximum profit = Rs 16200
Answer: B
Here , Maximise Z = 12x + 16y , subject to constraints : : x + y ≤ 1200, x - 2y ≥ 0,

x - 3y ≤ 600 , x,y ≥ 0
Here Z = 16000 is maximum.i.e. 800 dolls of type A and 400 dolls of type B; Maximum
profit = Rs 16000 .
_________________________________________________________________
274. Feasible region (shaded) for a LPP is shown in Figure. Maximize Z = 5x + 7y.
A. 49
B. 45
C. 43
D. 47
Answer: C
______________________________________________________________________
275. The corner point of the feasible region determined by the system of linear constraints
are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y.
Compare the quantity in Column A and Column B
Column A Column B
Maximum of Z 325
(a) The quantity in column A is greater

(b) The quantity in column B is greater
(c) The two quantities are equal
(d) The relationship cannot be determined On the basis of the information supplied
Answer: B

276. The feasible region for a LPP is shown shaded in the figure. Let Z = 3x – 4y be the
objective function. Minimum of Z occurs at
(a) (0, 0)
(b) (0, 8)
(c) (5, 0)
(d) (4, 10)
Answer: B

277. Maximize Z = − x + 2y, subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0

A. Z has maximum value three
B. Z has maximum value one
C. Z has maximum value
D. Z has no maximum value
Answer: D
278. Maximize Z = x + y, subject to x – y ≤ -1, -x + y ≤ 0, x, y ≥ 0.

A. Z has maximum value
B. Z has no maximum value
C. Z has no maximum value one
D. Z has no maximum value Two
Answer: B
279. Reshma wishes to mix two types of food P and Q in such a way that the vitamin
contents of the mixture contain at least 8 units of vitamin A and 11 units of vitamin B. Food
P costs Rs 60/kg and Food Q costs Rs 80/kg. Food P contains 3 units /kg of vitamin A and 5
units /kg of itamin B while food Q contains 4 units /kg of vitamin A and 2 units /kg of
vitamin B. Determine the minimum cost of the mixture?
A. (8/3, 0) and (2, 1/2)
B. (8/1, 0) and (2, 1/2)
C. (8/2, 0) and (21, 1/2)
D. (8/3, 1) and (12, 1/2)
Answer: A (8/3, 0) and (2, 1/2)
280. One kind of cake requires 200g flour and 25g of fat, and another kind of cake requires
100g of flour and 50g of fat. Find the maximum number of cakes which can be made from
5 kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients used
in making the cakes?
A. 30 (21 of one kind and 11 of the other kind).
B. 29 (20 of one kind and 10 of the other kind).
C. 31 (20 of one kind and 10 of the other kind).
D. 30 (20 of one kind and 10 of the other kind).
Answer: D 30 (20 of one kind and 10 of the other kind).
281. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of
machine time and 3 hours of craftsman’s time in its making while a cricket bat takes 3
hour of machine time and 1 hour of craftsman’s time. In a day, the factory has the
availability of not more than 42 hours of machine time and 24 hours of craftsman’s time.
(ii) What number of rackets and bats must be made if the factory is to work at full
capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the maximum
profit of the factory when it works at full capacity.
A. 200
B. 199
C. 202
D. 201
Answer: A
282. A manufacturer produces nuts ad bolts. It takes 1 hour of work on machine A and 3
hours on machine B to produce a package of nuts. It takes 3 hours on machine A and 1
hour on machine B to produce a package of bolts. He earns a profit, of Rs 17.50 per
package on nuts and Rs. 7.00 per package on bolts. How many packages of each should be
produced each day so as to maximize his profit, if he operates his machines for at the most
12 hours a day?
A. 73.50
B. 74.50
C. 71.50
D. 72.50
Answer: A 73.50
283. A factory manufactures two types of screws, A and B. Each type of screw requires the
use of two machines, an automatic and a hand operated. It takes 4 minutes on the
automatic and 6 minutes on handoperated machines to manufacture a package of screws
A, while it takes 6 minutes on automatic and 3 minutes on the hand operated machines to
manufacture a package of screws B. Each machine is available for at the most 4 hours on
any day. The manufacturer can sell a package of screws A at a profit of Rs 7 and screws B
at a profit of Rs10. Assuming that he can sell all the screws he manufactures, how many
packages of each type should the factory owner produce in a day in order to maximize his
profit? Determine the maximum profit.
A. 412
B. 411
C. 410
D. 409
Answer: C 410
284. A cottage industry manufactures pedestal lamps and wooden shades, each requiring
the use of a grinding/cutting machine and a sprayer. It takes 2 hours on grinding/cutting
machine and 3 hours on the sprayer to manufacture a pedestal lamp. It takes 1 hour on the
grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day,
the sprayer is available for at the most 20 hours and the grinding/cutting machine for at
the most 12 hours. The profit from the sale of a lamp is Rs 5 and that from a shade is Rs 3.
Assuming that the manufacturer can sell all the lamps and shades that he produces, how
should he schedule his daily production in order to maximize his profit?
A. The maximum value of Z is 30 at (3, 4)
B. The maximum value of Z is 33 at (4, 4)
C. The maximum value of Z is 31 at (3, 4)
D. The maximum value of Z is 32 at (4, 4)
Answer: D
285. A company manufactures two types of novelty souvenirs made of plywood. Souvenirs
of type A require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs
of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3
hours 20 minutes available for cutting and 4 hours of assembling. The profit is Rs 5 each
for type A and Rs 6 each for type B souvenirs. How many souvenirs of each type should the
company manufacture in order to maximize the profit?
A. 160
B. 161
C. 159
D. 162
Answer: A 160
286. A merchant plans to sell two types of personal computers − a desktop model and a
portable model that will cost Rs 25000 and Rs 40000 respectively. He estimates that the
total monthly demand of computers will not exceed 250 units.Determine the number of
units of each type of computers which the merchant should stock to get maximum profit if
he does not want to invest more than Rs 70 lakhs and if his profit on the desktop model is
Rs 4500 and on portable model is Rs 5000.
A. 1140000
B. 1150000
C. 1130000
D. 1120000
Answer: B 1150000
287. The corner points of the feasible region determined by the following system of linear
inequalities: 2x + y ≤ 10, x + 3y ≤ 15, xy ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px +
qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both (3, 4)
and (0, 5) is
(A) p = q
(B) p = 2q
(C) p = 3q
(D) q = 3p
Answer: D q = 3p

288. How many packets of each food should be used to maximize the amount of vitamin A
in the diet?
What is the maximum amount of vitamin A in the diet?
A. 283 units
B. 282 units
C. 281 units
D. 285 units
Answer: D 285 units
Rejected : Incomplete statement.
289. A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag
contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C.
Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of
element B, and 3 units of element C. The minimum requirements of nutrients A, B and C
are 18 units, 45 units and 24 units respectively. Determine the number of bags of each
brand which should be mixed in order to produce a mixture having a minimum cost per
bag? What is the minimum cost of the mixture per bag?
A. Rs 1940
B. Rs 1949
C. Rs 1950
D. Rs 1990
E. Answer: C Rs 1950
290. A dietician wishes to mix together two kinds of food X and Y in such a way that the
mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin
C. The vitamin content of one kg food is given below:

One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the
mixture which will produce the required diet?
A. Rs 112
B. Rs 115
C. Rs 111
D. Rs 113
Answer: A
291. A manufacturer makes two types of toys A and B. Three machines are needed for this
purpose and the time (in minutes) required for each toy on the machines is given below:

Each machine is available for a maximum of 6 hours per day. If the profit on each toy of
type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30
of type B should be manufactured in a day to get maximum profit.
A. 262.5 at (11, 30)
B. 262.5 at (10, 30)
C. 262.5 at (15, 30)
D. 222.5 at (15, 30)
Answer: C 262.5 at (15, 30)
292. An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on
each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The
airline reserves at least 20 seats for executive class. However, at least 4 times as many
passengers prefer to travel by economy class than by the executive class. Determine how
many tickets of each type must be sold in order to maximize the profit for the airline. What
is the maximum profit?
A. Rs 136000
B. Rs 126000
C. Rs 116000
D. Rs 139000
Answer: A Rs 136000
293. Two godowns A and B have grain capacity of 100 quintals and 50 quintals
respectively.
They supply to 3 ration shops, D, E and F whose requirements are 60, 50 and 40 quintals
respectively.
The cost of transportation per quintal from the godowns to the shops are given in the
following table:

How should the supplies be transported in order that the transportation cost is minimum?
What is the minimum cost?
A. 510 at (20, 50)
B. 510 at (10, 50)
C. 540 at (10, 50)
D. 520 at (10, 50)
Answer: B
294. An oil company has two depots A and B with capacities of 7000 L and 4000 L
respectively.
The company is to supply oil to three petrol pumps, D, E and F whose requirements are
4500L, 3000L and 3500L respectively. The distance (in km) between the depots and the
petrol pumps is given in the following table:

Assuming that the transportation cost of 10 litres of oil is Re 1 per km, how should the
delivery be scheduled in order that the transportation cost is minimum? What is the
minimum cost?
A. Rs 4400.
B. Rs 4600.
C. Rs 4300.
D. Rs 4200.
Answer: A Rs 4400.
295. A fruit grower can use two types of fertilizer in his garden, brand P and brand Q. The
amounts (in kg) of nitrogen, phosphoric acid, potash, and chlorine in a bag of each brand
are given in the table. Tests indicate that the garden needs at least 240 kg of phosphoric
acid at least 270 kg of potash and at most 310 kg of chlorine. If the grower wants to
minimize the amount of nitrogen added to the garden, how many bags of each brand
should be used? What is the minimum amount of nitrogen added in the garden?
A. 170 kg
B. 270 kg
C. 370 kg
D. 470 kg
Answer: D 470 kg
296. Refer to question 8. If the grower wants to maximize the amount of nitrogen added to
the garden, how many bags of each brand should be added? What is the maximum amount
of nitrogen added?
A. 395 kg.
B. 525 kg.
C. 595 kg.
D. 555 kg.
Answer: C 595 kg
297. A toy company manufactures two types of dolls, A and B. Market tests and available
resources have indicated that the combined production level should not exceed 1200 dolls
per week and the demand for dolls of type B is at most half of that for dolls of type A.
Further, the production level of dolls of type A can exceed three times the production of
dolls of other type by at most 600 units. If the company makes profit of Rs 12 and Rs 16 per
doll respectively on dolls A and B, how many of each should be produced weekly in order
to maximize the profit?
A. 16000.
B. 16002.
C. 60012.
D. 10900.
Answer: A 16000.
298. Minimize and Maximize Z = x + 2y Subject to x + 2y ≥ 100, 2x − y ≤ 0, 2x + y ≤ 200, x ≥

0, y ≥ 0.
A. (0, 40) and (50, 40)
B. (0, 50) and (30, 40)
C. (0, 30) and (10, 40)
D. (0, 50) and (20, 40)
Answer: D (0, 50) and (20, 40)
299. In a LLP, if the standard primal problem is of minimization, all the constraints involve the sign
A. ≥
B. =
C. ≤
D. Non
Answer: A ≥

300. The set of values of the variables X1,X2,X3…..Xn satisfying the constraint and non negative
restriction of LLP is
A. Unbounded solution
B. Feasible solution
C. No Solution
D. Non
Answer: B Feasible solution

301. The positive variable that is subtracted from the left side of the constraints to convert them
inequality is
A. Slack variable
B. Surplus variable
C. Both A And B
D. Non
Answer: B Surplus variable

302. How many variables in LLP can be solved graphically easily
A. Two
B. Three
C. Four
D. Six
Answer: A Two

303. If the value of objective function Z can be increased or decreased infinitely such are
A. Bounded function
B. Un Bounded function
C. Optimal Function
D. Non
Answer: B Un Bounded function

304. The system of linear inequation in LLP under which the given function is to be optimizes is
A. Inequalities
B. equalities
C. Constraint
D. Non
Answer: C Constraint

305. The best view of LP techniques is to find an optimal use of
A. Man power
B. Machin
C. Money
D. All
Answer: D All

306. Solve LLP graphically, the area bounded by equation of the constraint are
A. Bounded Region
B. Feasible Region
C. No Region
D. Non
Answer: B Feasible Region

307. If the value of objective function Z can be increased or decreased infinitely such are
A. Bounded function
B. Un Bounded function
C. Optimal Function
D. Non
Answer: B Un Bounded function

308. In LLP ------------------- are Linear
A. Only Constraint
B. Only Objective
C. Only Variable
D. A and B
Answer: D A and B

309. In a LLP of the standard primal problem of maximization of all constraint involve of sign
A. >
B. =
C. ≤
D. Non
Answer: C ≤

310. A feasible Solution to an LP Problem
A. Must Satisfy all of the problem constraint simultaneously

B. Need not satisfy all of the constraint
C. Must Optimize the value of constraint
D. Non
Answer: A Must Satisfy all of the problem constraint simultaneously

Rejected : Mcq is repeat
311. Which of the following is assumption of an LLP model
A. Divisibility
B. proportionality
C. Additivity
D. All of above
Answer: D All of above

312. The linear function of the variables which is to be maximize or minimize is
A. Constraint
B. Objective Function
D. Non
Answer: B Objective Function

313. Which is not a property of LLP
A. Resources must be limited

B. Only one objective Function
C. The Problem Must be of minimization Type
D. Non
Answer: C The Problem Must be of minimization Type

314. In graphical method the restriction on number of decision variables is

A. Two
B. Three
C. One
D. Non
Answer: A Two

315. In graphical method the restriction on number of constraint is
A. Two
B. Three
C. Five
D. Non
Answer: D Non

316. Graphical optimal value for Z can be obtained from
A. Corner Point of feasible region

B. Corner Point of infeasible region
C. Mid-Point of feasible region
D. Mid-Point of feasible region
Answer: A Corner Point of feasible region

317. The feasible solution of a L.L.P belongs to
A. First and second Quadrant

B. First And Third quadrant
C. Only in First Quadrant
D. Non
Answer: C Only in First Quadrant

318. Alternative solution exist in the linear programming problem when
A. Cone of the constraint is redundant

B. Two constraint are parallel
C. Objective function is parallel to one of the constraint
D. None
Answer: C Objective function is parallel to one of the constraint

319. For the maximize function Z = x + y and constraint given by x + y ≥ 8 and 3x + 5y ≤ 15
A. There are two feasible region

B. There are infinite feasible region
C. There is no feasible region
D. Non
Answer: C There is no feasible region

320. For the optimizing function function Z = x + y and constraint given by 2x + y ≤ 30 and x + y ≤ 25
Which one is the redundant constraint?
A. 2x + y ≤ 30
B. x + y ≤ 30
C. x ≤ 25
D. Non
Answer: C x ≤ 25

Chapter Name: Linear Programming

Uploaded by

Copyright:

Available Formats

You might also like

Chapter Name: Linear Programming

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter Name: Linear Programming

Uploaded by

Copyright:

Available Formats

Chapter Name: Linear Programming

2. The term Linear means that

3. The Linear program is a method for

5. Planning of allocation of limited resources to obtain an optimal result is called:

6. The theory of linear programming is a fairly

Topic: Linear Inequalities

9. Less than is denoted by

10. Greater than is denoted by

11. Less than or equal to is dented by

12. Greater than or equal to is denoted by

16. The graph of a linear inequality, in more than two variables is a

18. If the boundary line is included in either plan then it is called

19. Two or more two linear inequalities togeth

Topic: Feasible Region

28. In linear programming infeasible solutions

A. fall on the x = 0 plane

In linear programming infeasible solutions fall outside the feasible region .

30. Feasible region in the set of points which satisfy

Answer: C All of the given constraints

Difficulty Level: Medium

Answer: C Vertex point of the boundary of the feasible region

Difficulty Level: High

Answer: B function to be optimized

Difficulty Level: Medium

Answer: C Feasible solution

Difficulty Level: Medium

35. Solve the Linear inequality 3x – 2 ≥ 8 +5x

36. Graph the inequalities 2x – 5y ≥ 10

37. Graph the inequalities Y > X - 6

39. Identify the solution set for –( x – 3 ) < 5 – 2x

40. What is the solution set for 2(x−1)5≤3(2+x)7 ?

41. Identify the solution set for (x−1)3+4<(x−5)5−2.

Difficulty Level: High

42. Identify the solution set for 7x−58x+3>4

44. Identify solution set for | 4 − x | + 1 < 3?

45. What is the solution set for |x−2|x−2>0 ?

46. Identify the solution set for 1|x|−3<12 ?

47. Which of the following is correct?

A. If 0 > -7 , then 0 < 7

48. Solve the inequality 3 − 2x ≤ 9

50. The solution for the simultaneous linear inequalities 2x − 3 ≤ 7 and − x ≤ 2 is :

51. {4,5,6} is the solution set of

A. x > 4 and x > 7,xϵZ

53. Solve: 30x < 200, when x is a natural number:

54. The solution set for : 3x − 7 >x + 3.

55. The solution set for ( x + 3 ) + 4 > − 2x + 5:

56. Solve the system of inequalities 2x + 5 ≤ 0 , x − 3 ≤ 0

57. Solve the system of inequalities x − 2 > 0 , 3x < 18

58. Solve the system of inequalities − 4x + 1 ≥ 0 , 3 − 4x < 0

59. Solve the system of inequalities : x − 5 > 0, 2x−4x+2<2

60. Solve the system of inequalities: x+7x−8>2,2x+17x−1>5

61. Solve the system of inequalities − 2 ≤ 6x − 1 < 2

62. Solve the system of inequalities − 2 < 1 − 3x < 7

63. Solve the system of inequalitie: −15<3(x−2)5≤0

64. The solution set for | 3x − 2 | ≤ 1/2

A. [ 5/6 , 1/2 ]

66. The solution set for : |x|−1|x|−2≥0,x≠±2