GkSeries.com

Linear Programming Quiz | Linear Programming Multiple Choice Questions and Answers

Download PDF

Free download in PDF Linear Programming Multiple Choice Questions and Answers for competitive exams. These short objective type questions with answers are very important for Board exams as well as competitive exams like UPSC, NDA, SSC etc. These short solved questions or quizzes are provided by Gkseries./p>

Go To Download Page
(1) The region represented by 2x+3y−5≤0 and 4x−3y+2≤0 , is A
[A] Not in first quadrant
[B] Unbounded in first quadrant
[C] Bounded in first quadrant
[D] None of these
Answer: Unbounded in first quadrant
(2) Objective function of a L.P.P. is
[A] A constraint
[B] A function to be optimized
[C] A relation between the variables
[D] None of these
Answer: A function to be optimized

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

(3) The optimal value of the objective function is attained at the points
[A] Given by intersection of inequations with axes only
[B] Given by intersection of inequations with x-axis only
[C] Given by corner points of the feasible region
[D] None of these
Answer: Given by corner points of the feasible region
(4) 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: The problem is to be re-evaluated
(5) The constraints −𝑥1 + 𝑥2 ≤ 1, − 𝑥1 + 3𝑥2 ≤ 9 and 𝑥1, 𝑥2 ≥ 0 defined on
[A] Bounded feasible space
[B] Unbounded feasible space
[C] Both bounded and unbounded feasible space
[D] None of these
Answer: Unbounded feasible space
(6) Which of the terms is not used in a linear programming problem
[A] Slack variables
[B] Objective function
[C] Concave region
[D] Feasible solution
Answer: Concave region
(7) The area of the feasible region for the following constraints 3𝑦 + 𝑥 ≥ 3, 𝑥 ≥ 0,𝑦 ≥ 0 will be
[A] Bounded
[B] Unbounded
[C] Convex
[D] Concave
Answer: Unbounded
(8) For the L.P.problem

𝑀𝑖𝑛 𝑧 = 𝑥1 + 𝑥2 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 5𝑥1 + 10𝑥2 ≤ 0, 𝑥1 + 𝑥2 ≥ 1, 𝑥2 ≤ 4 𝑎𝑛𝑑 𝑥1, 𝑥2 ≥ 0

[A] There is a bounded solution
[B] There is no solution
[C] There are infinite solutions
[D] None of these
Answer: There is a bounded solution
(9) 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: Both objective function and constraints are linear
(10) Constraints means----
[A] limitations are expressed in mathematical equalities ( or inequalities)
[B] Assumption
[C] goal is to be achieved
[D] None of the above.
Answer: limitations are expressed in mathematical equalities ( or inequalities)
(11) The region which satisfies all the constrains of the L.P.P. is called as----
[A] phisible region
[B] Feasible region
[C] convex region
[D] Concave region
Answer: Feasible region
(12) In .L.P.P., while drawing the graph, on the X-axis Y values always-----
[A] 0
[B] 1
[C] 2
[D] None of the above
Answer: 0
(13) The set of decision variable which satisfies all the constraints of the LPP is called as-----
[A] Solution
[B] Basic Solution
[C] Feasible solution
[D] None of the above
Answer: Solution
(14) A solution which satisfies non-negative conditions also is called as-----
[A] Solution
[B] Basic Solution
[C] Feasible solution
[D] None of the above
Answer: Feasible solution
(15) A solution which optimizes the objective function is called as ------
[A] Solution
[B] Basic Solution
[C] Feasible solution
[D] Optimal solution
Answer: Optimal solution

Please share this page

Click Here to Read more questions

Teacher Eligibility Test