Practice Linear Programming Multiple Choice Questions with Answers Quiz-3 - MCQGeeks.com

Q.1.

The set of decision variable which satisfies all the constraints of the LPP is called as-----

solution
basic solution
feasible solution
none of the above

Q.2.

Constraints in an LP model represents

limititations
requirements
balancing, limitations and requirements
all of above

Q.3.

The true statement for the graph of inequations 3x+2y≤6 and 6x+4y≥, is

both graphs are disjoint
both do not contain origin
both contain point (1, 1)
none of these

Q.4.

A model is

an essence of reality
an approximation
an idealization
all of the above

Q.5.

The first step in formulating a linear programming problem is

identify any upper or lower bound on the decision variables
state the constraints as linear combinations of the decision variables
understand the problem
identify the decision variables

Q.6.

The value of objective function is maximum under linear constraints

at the center of feasible region
at (0,0)
at any vertex of feasible region
the vertex which is at maximum distance from (0, 0)

Q.7.

Maximization of objective function in LPP means

value occurs at allowable set decision
highest value is chosen among allowable decision
none of the above
all of the above

Q.8.

The linear function of the variables which is to be maximize or minimize is called

constraints
objective function
decision variable
none of the above

Q.9.

Alternative solution exist in a linear programming problem when

one of the constraint is redundant
objective function is parallel to one of the constraints
two constraints are parallel
all of the above

Q.10.

Operation research analysis does not

predict future operation
build more than one model
collect the relevant data
recommended decision and accept