On This Page

This set of Business Mathematics Multiple Choice Questions & Answers (MCQs) focuses on Linear Programming Problem Set 2

Q1 | A solution which optimizes the objective function is called as ------
  • solution
  • basic solution
  • feasible solution
  • optimal solution
Q2 | In. L.P.P----
  • objective function is linear
  • constraints are linear
  • both objective function and constraints are linear
  • none of the above
Q3 | 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 ignored.
Q4 | Linear programming is a
  • constrained optimization technique
  • technique for economic allocation of limited resources
  • mathematical technique
  • all of the above
Q5 | A constraint in an LP model restricts
  • value of objective function
  • value of a decision variable
  • use of the available resources
  • all of the above
Q6 | 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
Q7 | The best use of linear programming technique is to find an optimal use of
  • money
  • manpower
  • machine
  • all of the above
Q8 | 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
Q9 | Which of the following is an assumption of an LP model
  • divisibility
  • proportionality
  • additivity
  • all of the above
Q10 | Which of the following is a limitation associated with an LP model
  • the relationship among decision variables in linear
  • no guarantee to get integer valued solutions
  • no consideration of effect of time & uncertainty on lp model
  • all of the above
Q11 | The graphical method of LP problem uses
  • objective function equation
  • constraint equations
  • linear equations
  • all of the above
Q12 | 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
Q13 | 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
Q14 | 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
Q15 | 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
Q16 | 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
Q17 | While plotting constraints on a graph paper, terminal points on both the axes are connectedby a straight line because
  • the resources are limited in supply
  • the objective function as a linear function
  • the constraints are linear equations or inequalities
  • all of the above
Q18 | Operations research is the application of ____________methods to arrive at the optimalSolutions to the problems.
  • economical
  • scientific
  • a and b both
  • artistic
Q19 | Operations research was known as an ability to win a war without really going in to ____
  • battle field
  • fighting
  • the opponent
  • both a and b
Q20 | Who defined OR as scientific method of providing execuitive departments with a quantitativebasis for decisions regarding the operations under their control?
  • morse and kimball (1946)
  • p.m.s. blackett (1948)
  • e.l. arnoff and m.j. netzorg
  • none of the above
Q21 | What enables us to determine the earliest and latest times for each of the events and activitiesand thereby helps in the identification of the critical path?
  • programme evaluation
  • review technique (pert)
  • both a and b
  • deployment of resources
Q22 | In Degenerate solution value of objective function _____________.
  • increases infinitely
  • basic variables are nonzero
  • decreases infinitely
  • one or more basic variables are zero
Q23 | OR has a characteristics that it is done by a team of
  • scientists
  • mathematicians
  • academics
  • all of the above
Q24 | Feasible solution satisfies __________
  • only constraints
  • only non-negative restriction
  • [a] and [b] both
  • [a],[b] and optimum solution
Q25 | When total supply is equal to total demand in a transportation problem, the problem is said tobe
  • balanced
  • unbalanced
  • degenerate
  • none of the above