1
The best use of linear programming is to find optimal use of
Answer: All the above
Questions
3
Before formulating a formal LP model, it is better to
Answer: all of the above
4
Non-negative condition in an LP model implies
Answer: non-negative value of resourse
5
For the constraint of a linear optimizing function z=x1+x2 given by x1+x2≤1, 3x1+x2≥3 and x1, x2≥0
Answer: There is no feasible region
6
The intermediate solutions of constraints must be checked by substituting them back into
Answer: Constraint equations
7
A basic solution is called non-degenerate, if
Answer: None of the basic variables is zero
8
If the number of available constraints is 3 and the number of parameters to be optimized is 4, then
Answer: The constraints are short in number
9
The graph of x≤2 and y≥2 will be situated in the
Answer: Second and third quadrant
10
The feasible solution of a L.P.P. belongs to
Answer: Only in the first quadrant
11
The true statement for the graph of inequations 3x+2y≤6 and 6x+4y≥20 , is
Answer: Both graphs are disjoint
12
A vertex of bounded region of inequalities 𝑥 ≥ 0 ,𝑥 + 2𝑦 ≥ 0 and 2𝑥 + 𝑦 ≤ 4, is
Answer: (0,0)
13
In which quadrant, the bounded region for the inequations 𝑥 + 𝑦 ≤ 1 and 𝑥 − 𝑦 ≤ 1 is situated
Answer: I, II
14
The necessary condition for third quadrant region in xy-plane, is
Answer: x<0, y<0
15
The value of objective function is maximum under linear constraints
Answer: At any vertex of feasible region
