Deck 6: Linear Programming LP Model and Techniques

Question 1

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

Answer 1

relationship among all variables is linear

Question 2

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

Answer 2

manpower

Question 3

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

Answer 3

the problem must be of minimization type

Question 4

Which of the following is an assumption of an LP model

A)divisibility
B)proportionality
C)additivity
D)all of the above

Question 5

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

Question 6

The graphical method of LP problem uses

A)objective function equation
B)constraint equations
C)linear equations
D)all of the above

Question 7

A feasible solution to an LP problem

A)must satisfy all of the problem's constraints simultaneously
B)need not satisfy all of the constraints, only some of them
C)must be a corner point of the feasible region
D)must optimize the value of the objective function

Question 8

An iso-profit line represents

A)an infinite number of solutions all of which yield the same profit
B)an infinite number of solution all of which yield the same cost
C)an infinite number of optimal solutions
D)a boundary of the feasible region

Question 9

If an iso-profit line yielding the optimal solution coincides with a constaint line, then

A)the solution is unbounded
B)the solution is infeasible
C)the constraint which coincides is redundant
D)none of the above

Question 10

A constraint in an LP model becomes redundant because

A)two iso-profit line may be parallel to each other
B)the solution is unbounded
C)this constraint is not satisfied by the solution values
D)none of the above

Question 11

Constraints in LP problem are called active if they

A)represent optimal solution
B)at optimality do not consume all the available resources
C)both a & b
D)none of the above

Question 12

Mathematical model of Linear Programming is important because

A)It helps in converting the verbal description and numerical data into mathematical expression
B)decision makers prefer to work with formal models.
C)it captures the relevant relationship among decision factors.
D)it enables the use of algebraic techniques.

Question 13

In graphical method of linear programming problem if the iOS-cost line coincide with a side of region of basic feasible solutions we get

A)Unique optimum solution
B)unbounded optimum solution
C)no feasible solution
D)Infinite number of optimum solutions

Question 14

If the value of the objective function can be increased or decreased indefinitely, such solution is called

A)Bounded solution
B)Unbounded solution
C)Solution
D)None of the above

Question 15

For the constraint of a linear optimizing function z=x1+x2 given by x1+x2?1, 3x1+x2?3 and x1, x2?0

A)There are two feasible regions
B)There are infinite feasible regions
C)There is no feasible region
D)None of these

Question 16

If the number of available constraints is 3 and the number of parameters to be optimized is 4, then

A)The objective function can be optimized
B)The constraints are short in number
C)The solution is problem oriented
D)None of these

Question 17

Non-negativity condition is an important component of LP model because

A)Variables value should remain under the control of the decision-maker
B)Value of variables make sense & correspond to real-world problems
C)Variables are interrelated in terms of limited resources
D)None of the above

Question 18

Maximization of objective function in an LP model means

A)Value occurs at allowable set of decisions
B)Highest value is chosen among allowable decisions
C)Neither of above
D)Both a & b

Question 19

Which of the following is not a characteristic of the LP model

A)Alternative courses of action
B)An objective function of maximization type
C)Limited amount of resources
D)Non-negativity condition on the value of decision variables.

Question 20

Which of the following statements is true with respect to the optimal solution of an LP problem

A)Every LP problem has an optimal solution
B)Optimal solution of an LP problem always occurs at an extreme point
C)At optimal solution all resources are completely used
D)If an optimal solution exists, there will always be at least one at a corner

Question 21

While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because

A)The resources are limited in supply
B)The objective function as a linear function
C)The constraints are linear equations or inequalities
D)All of the above

Question 22

In graphical method of linear programming problem if the iOS-cost line coincide with a side of region of basic feasible solutions we get

A)unique optimum solution
B)unbounded optimum solution
C)no feasible solution
D)infinite number of optimum solutions

Question 23

If the value of the objective function can be increased or decreased indefinitely, such solution is called

A)bounded solution
B)unbounded solution
C)solution
D)none of the above

Question 24

For the constraint of a linear optimizing function z=x1+x2 given by x1+x2?1, 3x1+x2?3 and x1, x2?0

A)there are two feasible regions
B)there are infinite feasible regions
C)there is no feasible region
D)none of these