Question 1

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

Accepted Answer

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

Question 2

Alternative solution exist in a linear programming problem when

Accepted Answer

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 
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 D

Question 3

Linear programming is a

Accepted Answer

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

Question 4

Constraints in an LP model represents

Accepted Answer

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

Question 5

Non-negative condition in an LP model implies

Accepted Answer

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 
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 6

Before formulating a formal LP model, it is better to

Accepted Answer

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

Question 7

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

Accepted Answer

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

Question 8

A constraint in an LP model restricts

Accepted Answer

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

Question 9

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

Accepted Answer

A) objective function 
B) constraint equations 
C) not required 
D) none of the above 
A) objective function 
B) constraint equations 
C) not required 
D) none of the above

Question 10

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

Accepted Answer

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

Question 11

A basic solution is called non-degenerate, if

Accepted Answer

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 
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 12

If the constraints in a linear programming problem are changed

Accepted Answer

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

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

Accepted Answer

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

Question 14

A model is

Accepted Answer

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

Question 15

Maximization of objective function in LPP means

Accepted Answer

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 
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 16

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

Accepted Answer

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

Question 17

Operation research analysis does not

Accepted Answer

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

Question 18

A constraint in an LP model restricts

Accepted Answer

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

Question 19

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

Accepted Answer

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

Question 20

In. L.P.P----

Accepted Answer

A) objective function is linear 
B) constraints are linear 
C) both objective function and constraints are linear 
D) none of the above 
A) objective function is linear 
B) constraints are linear 
C) both objective function and constraints are linear 
D) none of the above

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

Alternative solution exist in a linear programming problem when

Linear programming is a

Constraints in an LP model represents

Non-negative condition in an LP model implies

Before formulating a formal LP model, it is better to

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

A constraint in an LP model restricts

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

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

A basic solution is called non-degenerate, if

If the constraints in a linear programming problem are changed

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

A model is

Maximization of objective function in LPP means

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

Operation research analysis does not

A constraint in an LP model restricts

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

In. L.P.P----

Ratio and Proportion Problems

Mathematical Problems on Fractions, Ratios, and Percentages

Mathematical Problems for Profit and Loss

Simple Interest and Installment Calculations

Linear Programming LP Model and Techniques

Operations Research and Transportation Problem: An Exploration of Constraints, Optimization, and Feasible Solutions

Filters

Exam 5: Linear Programming and Operation Research Analysis

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

Alternative solution exist in a linear programming problem when

Linear programming is a

Constraints in an LP model represents

Non-negative condition in an LP model implies

Before formulating a formal LP model, it is better to

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

A constraint in an LP model restricts

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

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

A basic solution is called non-degenerate, if

If the constraints in a linear programming problem are changed

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

A model is

Maximization of objective function in LPP means

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

Operation research analysis does not

A constraint in an LP model restricts

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

In. L.P.P----

Ratio and Proportion Problems

Mathematical Problems on Fractions, Ratios, and Percentages

Mathematical Problems for Profit and Loss

Simple Interest and Installment Calculations

Linear Programming LP Model and Techniques

Operations Research and Transportation Problem: An Exploration of Constraints, Optimization, and Feasible Solutions

Filters