Top 50+ Solved LINEAR PROGRAMMING PROBLEM MCQ Questions Answer

From 16 to 30 of 43

Q. 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

  • a. solution

Q. The intermediate solutions of constraints must be checked by substituting them back into

a. objective function

b. constraint equations

c. not required

d. none of the above

  • b. constraint equations

Q. 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

  • b. none of the basic variables is zero

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

a. solution

b. basic solution

c. feasible solution

d. none of the above

  • c. feasible solution

Q. A solution which optimizes the objective function is called as ------

a. solution

b. basic solution

c. feasible solution

d. optimal solution

  • d. optimal solution

Q. 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

  • c. both objective function and constraints are linear

Q. 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 ignore

  • a. the problem is to be re-evaluated

Q. Linear programming is a

a. constrained optimization technique

b. technique for economic allocation of limited resources

c. mathematical technique

d. all of the above

  • d. all of the above

Q. 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

  • d. all of the above

Q. 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

  • a. relationship among all variables is linear

Q. 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

  • b. manpower

Q. 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

  • d. the problem must be of minimization type

Q. Which of the following is an assumption of an LP model

a. divisibility

b. proportionality

c. additivity

d. all of the above

  • d. all of the above

Q. 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

  • d. all of the above

Q. The graphical method of LP problem uses

a. objective function equation

b. constraint equations

c. linear equations

d. all of the above

  • d. all of the above
Subscribe Now

Get All Updates & News