0% found this document useful (0 votes)
57 views13 pages

Ot MCQ 3

This document contains a set of multiple choice questions related to optimization techniques and linear programming. There are 47 questions in total covering topics like constraints, objective functions, feasible solutions, graphical representation, and the simplex method for solving linear programming problems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
57 views13 pages

Ot MCQ 3

This document contains a set of multiple choice questions related to optimization techniques and linear programming. There are 47 questions in total covering topics like constraints, objective functions, feasible solutions, graphical representation, and the simplex method for solving linear programming problems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Optimization Techniques MCQ Questions Part-2

(Linear Programming)
1.In an Linear programming problem, the restrictions or limitations under which the
objective

function is to be optimised are called

1. Constraints

2. Objective function

3. More than one of the above.

4. None of the above

2.Which of the following methods is commonly used to solve assignment problems?

1. Stepping stone method

2. Hungarian method

3. North - west corner method

4. Vogel's approximation method

3.In a transportation problem with 4 supply points and 5 demand points, how many
number

of constraints are required in its formulation?

1. 20

2. 1

3. 0

4. 9
4.Important Points to remember:-

Number of constraints = m + n

Number of variables = m × n

Number of equations = m + n – 1

5.If the ith constraint of a primal (maximisation) is equality, then the dual
(minimisation)

variable ‘yi’ is:

1. ≥ 0

2. ≤ 0

3. Unrestricted in sign

4. None of the above

6.Vogel’s approximation method is connected with

1. Assignment problem

2. Inventory problem

3 Transportation problem

4. PERT
7.In the Simplex method if in pivot column all the entries are negative or zero when
choosing

leaving variable then

1. Solution is Degenerate

2. Solution is infeasible

3. Alternative optima

4. Unbounded

8: Region represented by x ≥ 0, y ≥ 0 is:

A. first quadrant

B. second quadrant

C. third quadrant

D. fourth quadrant

9: The objective function of a linear programming problem is:

A. a constraint

B. function to be optimised

C. A relation between the variables

D. None of these
10: The linear inequalities or equations or restrictions on the variables of a linear
programming problem are called:

A. a constraint

B. Decision variables

C. Objective function

D. None of the above

11: A set of values of decision variables that satisfies the linear constraints and non-
negativity conditions of an L.P.P. is called its:

A. Unbounded solution

B. Optimum solution

C. Feasible solution

D. None of these

12: The maximum value of Z = 3x + 4y subjected to constraints x + y ≤ 4, x ≥ 0 and y ≥


0 is:

A. 12

B. 14

C. 16

D. None of the above


13: The optimal value of the objective function is attained at the points:

A. on X-axis

B. on Y-axis

C. corner points of the feasible region

D. none of these

14: Which of the following is a type of Linear programming problem?

A. Manufacturing problem

B. Diet problem

C. Transportation problems

D. All of the above

15. Objective function of an LP problem is


(a) a constant
(b) a function to be optimized
(c) an inequality
(d) a quadratic equation

16. The optimal value of the objective function is attained at the points
(a) given by intersection of lines representing inequations with axes only
(b) given by intersection of lines representing inequations with X-axis only
(c) given by corner points of the feasible region
(d) at the origin
17. Which of the following statements is correct ?
(a) Every LP problem has at least one optimal solution.
(b) Every LP problem has a unique solution.
(c) If an LP problem has two optimal solutions, then it has infinitely many solutions.
(d) If a feasible region is unbounded then LP problem has no solution

18 For the LP problem Minimize z = 2x + 3y the coordinates of the


corner points of the bounded feasible region are
A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z is
(a) 49
(b) 15
(c) 10
(d) 05

19 For the LP problem maximize z = 2x + 3y The coordinates of the


corner points of the bounded feasible region are
A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z is
(a) 72
(b) 80
(c) 82
(d) 70

20 The corners points of the feasible region determined by the system of


linear constraints are (0, 10), (5, 5) (15, 15), (0, 20). Let z= px + qy,
where p, q > 0.Condition on p and q so that the maximum of z occurs at
both the points (15, 15) and (0, 20) is _____
(a) p = q
(b) p =2q
(c) q = 2p
(d) q = 3p
21. Solution of following LP problem Minimize z =-3x + 2y subject
to 0 ≤ x ≤ 4, 1 ≤ x ≤ 6, x + y ≤ 5 is
(a) -10
(b) 0
(c) 2
(d) 10

22. The corner points of the feasible region determined by the system of
linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Suppose z = px + 3y,
where p > 0. If the maximum of z occurs at both the points (15, 15) and (0, 20), then p = _____ .
(a) 4
(b) 5
(c) 1
(d) 2

23. The position of points O (0, 0) and P (2, -3) in the region of graph of
inequation 2x - 3y < 5 will be _____ .
(a) O inside and P outside
(b) O and P both inside
(c) O and P both outside
(d) O outside and P inside

24.The mathematical model of an LP problem 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 technique
25.Linear programming is a

(a) constrained optimization technique


(b) technique for economic allocation of limited resources
(c) mathematical technique
(d) all of these

26.A constraint in an LP model restricts

(a)value of the objective function


(b)value of a decision variable
(c)use of the available resource
(d)all of these

27.The distinguishing feature of an LP mode is

(a) relationship among all variables is linear


(b) it has single objective function and constraints
(c) value of decision variables is non-negative
(d) all of the above

28.Every mathematical model

(a) must be deterministic


(b) represents data in numerical form
(c) all of these
(d) requires computer aid for its solution
29.A physical model is example of

(a) an iconic model


(b) an analogue model
(c) a verbal model
(d) a mathematical model

30.An optimization model

(a) provides the best decision


(b) provides a decision within its limited context
(c) helps in evaluating various alternatives
(d) all of these

31.The quantitative approach to decision analysis is a

(a) logical approach


(b) rational approach
(c) scientific approach
(d) all of these

32.Operations research practitioners do not

(a) take responsibility for the solution implementation


(b) collect essential data
(c) predict future actions/operations
(d) build more than one model
33.OR approach is typically based on the use of

(a) Physical model


(b) Mathematical model
(c) Iconic model
(d) Descriptive model

34.The mathematical model of an LP problem is important because

(a) it helps in converting the verbal description and numerical data into a 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 technique

35.Operations Research is the outcome of

(a) National emergency Combined efforts of talents of all fields Economics and Engineering
(b) Political problems
(c) Combined efforts of talents of all fields
(d) Economics and Engineering

36.The name of the subject Operations Research is due to the fact that

(a) Problems can be solved by the war approach


(b) The researchers do the operations
(c) The war problems are generally known as operations and inventing
a new way of solving such problems
(d) Mathematical operations are used in solving the problems
37.The person who coined the name Operations Research is:

(a) Bellman
(b) Newman
(c) McClosky and Trefrhen
(d) None of these

38.The objective of Operations Research is:

(a) To find new methods of solving Problems


(b) To derive formulas
(c) Optimal utilization of existing resources
(d) To utilize the services of scientists.

39.The first step in solving Operations Research problem is

(a) Model building


(b) Obtain alternate solutions
(c) Obtain basic feasible solutions,
(d) Formulation of the problem.

40.The model, which gives physical or visual representation of the problem,


is

(a) Analogue model,


(b) Static model,
(c) Iconic model,
(d) Symbolic model
41.A wide class of allocation models can be solved by a mathematical technique known as:

(a) Classical model,


(b) Mathematical Model,
(c) Descriptive model,
(d) Linear Programming model.

42.One of the properties of Linear Programming Model is

(a)It will not have constraints,


(b)It should be easy to solve,
(c)It must be able to adapt to solve any type of problem,
(d)The relationship between problem variables and constraints must be linear.

43.One of the properties of the Linear Programming Model is

(a) It will not have constraints,


(b) It should be easy to solve,
(c) It must be able to adapt to solve any type of problem,
(d) The relationship between problem variables and constraints must be linear.

44.The slack variables indicate

(a) Excess resource available


(b) Shortage of resource available
(c) Nil resources
(d) Idle resource.
45.In the graphical solution of solving Linear Programming problem to
convert inequalities into equations, we

(a) Use Slack variables


(b) Use Surplus variables,
(c) Use Artificial surplus variables
(d) Simply assume them to be equations

46.To transfer the key row in simplex table we have to

(a) Add the elements of the key row to the key number
(b) Subtract the elements of a key row from topmost no key row
(c) Divide the elements of the key row by the key number
(d) None of these

47.When all the elements of replacement ratio column are equal, the
situation is known as

(a) Tie,
(b) Degeneracy
(c) Break
(d) None of these

You might also like