# Optimization Techniques MCQs

This is a set of 20 questions or MCQs on Optimization Techniques. For different topics, MCQs click here.

01. A constraint of the type greater than or equality sign can be
converted to an equation by subtracting a __ variable from the
left side of the constraint.

(a) Slack variables (b) Surplus variables
(c) Artificial variables (d) all of the above

02. If the kth constraint of the primal problem is an equality, then the
corresponding dual variable yk is _.

(a) unrestricted in sign (b) restricted in sign
(c) nothing can be said (d) none of the above

03. The method used to solve LPP with out the use of artifical variables
is called the __ method.

(a) Big M method (b) cutting plane method
(c) dual simplex method (d) simplex method.

04. An assignment problem represents a transportation problem with
all demands and supplies equal to _.

(a) 1 (b) greater than 1(c) some values greater than 1 (d) all of the above.

05. Slack of an activity can be calculated by the formula _.
(a) LFT+EST (b) LFT-EST
(c) LST-EFT (d) LFT X EFT.

06.The activity durations follow _________distribution in PERT.
(a) alpha (b) gamma(c) beta (d)lambda

07. The maximization or minimization of a quantity is the
(A) the goal of management science.
(B) the decision for decision analysis.
(C) the constraint of operations research.
(D) the objective of linear programming.

08. In solving an LPP by the simplex method __ variable is associated with equality type constraint.
(A) Artificial
(B) Slack
(C) Surplus (D) Both slack and surplus

09. If either the primal or the dual problem has an unbounded solution,
then the other problem has ________

(A) Feasible solution
(B) No feasible solution
(C) Bounded solution
(D) Unbounded solution

10. A basic feasible solution is called if the value of at least one basic
variable is zero
(A) Degenerate (B) Non degenerate
(C) Optimum (D) No solution

11. To convert ≥ inequality constraints into equality constraints, we must
(B) subtract an artificial variable
(C) subtract a surplus variable and an add artificial variable
(D) add a surplus variable and subtract an artificial variable

12. CPM is ___________
(A) Critical Project Management
(B) Critical Path Management
(C) Critical Path Method
(D) Crash Project Method

13. Activity which starts only after finishing other activity is called_________.
(A) dummy (C) successor
(B) Predecessor (D) both C and D

14. .……………… is known as a greedy algorithm, because it chooses at
each step the cheapest edge to add to subgraph S.

(A) Kruskal’s algorithm
(B) Prim’s algorithm
(C) Dijkstra algorithm
(D) Bellman ford algorithm

15. _____ is the amount of time within which an activity can be delayed
without affecting the project completion time.

(A) Independent float
(B) free float
(C) slack of an event
(D) total float

16. Rather than build a subgraph one edge at a time …………………………. builds a tree one vertex at a time.
A) kruskal’s algorithm
B) prim’s algorithm
C) dijkstra algorithm
D) bellman ford algorithm

17. Solving an integer programming problem by rounding off answers
obtained by solving it as a linear programming problem (using
simplex), we find that

(A) the values of decision variables obtained by rounding off
are always very close to the optimal values.
(B) the value of the objective function for a maximization
problem will likely be less than that for the simplex
solution.
(C) the value of the objective function for a minimization
problem will likely be less than that for the simplex
solution.
(D) all constraints are satisfied exactly.

18. In mixed integer programming problems, the optimum values are___

(A) all values are integers
(B) All values are either zero or one
(C) Some are non-integer values
(D) all are not integers.

19. In pure integer programming problems, the optimum values are

(A) all values are integers
(B) All values are either zero or one
(C) Some are non-integer values
(D) all are not integers.

20. The construction of the fractional cut does not require the slack
variables to be integers.

(A) True
(B) False
(C) Some times true
(D) Sometimes false

Optim

iationTechniques