Deck 5: Linear Programming and Operation Research Analysis

Question 1

Operation research analysis does not

A)predict future operation
B)build more than one model
C)collect the relevant data
D)recommended decision and accept

Answer 1

predict future operation

Question 2

A constraint in an LP model restricts

A)value of the objective function
B)value of the decision variable
C)use of the available resourses
D)all of the above

Answer 2

all of the above

Question 3

A feasible solution of LPP

A)must satisfy all the constraints simultaneously
B)need not satisfy all the constraints, only some of them
C)must be a corner point of the feasible region
D)all of the above

Answer 3

must satisfy all the constraints simultaneously

Question 4

Maximization of objective function in LPP means

A)value occurs at allowable set decision
B)highest value is chosen among allowable decision
C)none of the above
D)all of the above

Question 5

Alternative solution exist in a linear programming problem when

A)one of the constraint is redundant
B)objective function is parallel to one of the constraints
C)two constraints are parallel
D)all of the above

Question 6

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

A)constraints
B)objective function
C)decision variable
D)none of the above

Question 7

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

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

Question 8

The value of objective function is maximum under linear constraints

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

Question 9

A model is

A)an essence of reality
B)an approximation
C)an idealization
D)all of the above

Question 10

Constraints in an LP model represents

A)limititations
B)requirements
C)balancing, limitations and requirements
D)all of above

Question 11

The best use of linear programming is to find optimal use of

A)money
B)manpower
C)machine
D)all the above

Question 12

Before formulating a formal LP model, it is better to

A)express each constraints in words
B)express the objective function in words
C)verbally identify decision variables
D)all of the above

Question 13

Non-negative condition in an LP model implies

A)a positive coefficient of variables in objective function
B)a positive coefficient of variables in any constraint
C)non-negative value of resourse
D)none of the above

Question 14

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

Question 15

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

Question 16

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

Question 17

The graph of x?2 and y?2 will be situated in the

A)first and second quadrant
B)second and third quadrant
C)first and third quadrant
D)third and fourth quadrant

Question 18

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

A)solution
B)basic solution
C)feasible solution
D)none of the above

Question 19

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

A)solution
B)basic solution
C)feasible solution
D)optimal solution

Question 20

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

Question 21

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

Question 22

Linear programming is a

A)constrained optimization technique
B)technique for economic allocation of limited resources
C)mathematical technique
D)all of the above

Question 23

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