Q.1
If the value of the objective function 𝒛 can be increased or decreased indefinitely, such solution is called
  • Bounded solution
  • Unbounded solution
  • Solution
  • None of the above
Q.2
Mathematical model of Linear Programming is important because
  • It helps in converting the verbal description and numerical data into mathematical expression
  • decision makers prefer to work with formal models.
  • it captures the relevant relationship among decision factors.
  • it enables the use of algebraic techniques.
Q.3
Constraints in LP problem are called active if they
  • represent optimal solution
  • at optimality do not consume all the available resources
  • both a & b
  • none of the above
Q.4
A constraint in an LP model becomes redundant because
  • two iso-profit line may be parallel to each other
  • the solution is unbounded
  • this constraint is not satisfied by the solution values
  • none of the above
Q.5
If an iso-profit line yielding the optimal solution coincides with a constaint line, then
  • the solution is unbounded
  • the solution is infeasible
  • the constraint which coincides is redundant
  • none of the above
Q.6
An iso-profit line represents
  • an infinite number of solutions all of which yield the same profit
  • an infinite number of solution all of which yield the same cost
  • an infinite number of optimal solutions
  • a boundary of the feasible region
Q.7
A feasible solution to an LP problem
  • must satisfy all of the problem’s constraints simultaneously
  • need not satisfy all of the constraints, only some of them
  • must be a corner point of the feasible region
  • must optimize the value of the objective function
Q.8
The graphical method of LP problem uses
  • objective function equation
  • constraint equations
  • linear equations
  • all of the above
Q.9
Which of the following is an assumption of an LP model
  • divisibility
  • proportionality
  • additivity
  • all of the above
Q.10
If the constraints in a linear programming problem are changed
  • the problem is to be re-evaluated
  • solution is not defined
  • the objective function has to be modified
  • the change in constraints is ignore
Q.11
In. L.P.P----
  • objective function is linear
  • constraints are linear
  • both objective function and constraints are linear
  • none of the above
Q.12
Which of the following is not a characteristic of the LP
  • resources must be limited
  • only one objective function
  • parameters value remains constant during the planning period
  • the problem must be of minimization type
Q.13
The best use of linear programming technique is to find an optimal use of
  • money
  • manpower
  • machine
  • all of the above
Q.14
The distinguishing feature of an LP model is
  • relationship among all variables is linear
  • it has single objective function & constraints
  • value of decision variables is non-negative
  • all of the above
Q.15
Linear programming is a
  • constrained optimization technique
  • technique for economic allocation of limited resources
  • mathematical technique
  • all of the above
Q.16
A solution which optimizes the objective function is called as ------
  • solution
  • basic solution
  • feasible solution
  • optimal solution
Q.17
A solution which satisfies non-negative conditions also is called as-----
  • solution
  • basic solution
  • feasible solution
  • none of the above
Q.18
The graph of x≤2 and y≥2 will be situated in the
  • first and second quadrant
  • second and third quadrant
  • first and third quadrant
  • third and fourth quadrant
Q.19
A basic solution is called non-degenerate, if
  • all the basic variables are zero
  • none of the basic variables is zero
  • at least one of the basic variables is zero
  • none of these
Q.20
The intermediate solutions of constraints must be checked by substituting them back into
  • objective function
  • constraint equations
  • not required
  • none of the above
0 h : 0 m : 1 s