Optimization Techniques for Decision Making MCQ 23 August 2022

Section G Module I

1. Enter your Full Name *

Tarun Chaudhary

2. Enter your Roll Number *

2201204

3. In a simplex table at any iteration, the inverse of the basis matrix is given by the columns
under:
(1 Point)

original slack variables

original slack or artificial variables

initial basic variables

current basic variables

4. Most software prefer 2 phase to Big M method because:(1 Point)

2 phase method requires fewer iterations for optimality

2 phase method is guaranteed to converge to feasible solution

2 phase method does not cause scaling issues due to large M

 2 phase method is guaranteed to eliminate artificial variables

5. An assignment problem with five jobs to be performed and five employees to do these jobs
will have how many constraints?

(1 Point)

10

15

25

6. Which of the following is true if the primal LP is minimization and all constraints are >=
RHS?
(1 Point)

Increase in RHS of any constraint will not decrease the objective value

The shadow price of all constraints are positive

The shadow price of a constraint is positive only if RHS is positive

The shadow price of a constraint is positive only if LHS equals RHS

7. Which of the following statements is true for the LP formulation of an assignment model:

(1 Point)

All decision variables must be declared as binary..

Objective function should be minimisation

All supply and demand quantities must be zero or one

 None of the above

8. Which of the following is true if a dual variable is negative in the optimal solution to the
minimization dual problem?
(1 Point)

The corresponding primal problem has no feasible solution

The corresponding primal solution is not optimal

The corresponding primal constraint has negative RHS

The corresponding primal constraint is >= type and binding

9. The solution to the dual problem is obtained by the product of the(1 Point)

cost vector of basic variables with RHS

cost vector of basic variables with inverse of the basis

cost vector of non basic variables with inverse of the basis

inverse of the basis with the RHS

10. Which of the following is true in decision tree analysis where the payoffs indicate the
profits and all payoffs and probabilities are different in value?
(1 Point)

Maximax criteria always gives higher profits than expected value

Expected profit with perfect information is always  higher than expected profit .

Expected profit with imperfect information is always higher than expected profit .

All of the above

11. In the two phase simplex method, if an artificial variable is basic with value zero, then we
cannot proceed to second phase.
(1 Point)

True

False

12. Which of the following statements is true in a single server queue system with Poisson
arrivals and exponential services?
(1 Point)

The length of queue decreases if the mean arrival rate is less than mean service rate

The average queue length will become zero if mean arrival rate is less than mean service
rate

The average number of departures after service from the queue system equals average ar‐
rival rate

None of the above

13. The two phase approach is not needed for primal simplex method if(1 Point)

the solution obtained by setting original decision variables to zero is feasible

if RHS is positive for all constraints

all constraints are of <= type

All of the above

14. In a LP formulation of transportation model, if total demand exceeds total supply, then the
demand constraints are written as equalities.
(1 Point)
 True

False

15. In a M/M/1 queue if both the arrival and service rates are doubled, then which of the
following is true?
(1 Point)

The average length of queue becomes halved

The average waiting time of customer is halved

The average utilization of server is doubled

All of the above

16. In Monte Carlo simulation of queue systems, we must ensure that:(1 Point)

Inter arrival time are exponential

Average inter arrival times are more than average service times

Average inter arrival times and average service times correspond to the values in the real
system

The system reaches steady state after some time

17. If a maximization problem is solved using Two Phase simplex, then the objective value
cannot increase after Phase I.
(1 Point)

True

False
18. The solution to be Transshipment model is always integer if all the supply and demands
are integers.
(1 Point)

True

False

19. In a LP with maximization objective, the shadow price is non-negative for a constraint with
positive RHS.
(1 Point)

True

False

20. Which of the following models would be used to determine how a person can travel from
one city to another while minimizing total distance travelled?

(1 Point)

Shortest-path model

Travelling Salesman model

Transportation Model

Transshipment model

21. Which of the following is true in decision tree analysis with positive payoffs when both
alternatives have same expected payoffs?
(1 Point)

Select both alternatives with equal probability

Consistently select any one alternative with probability 1.0

 Select any one alternative randomly

Select the alternative with maximin criteria

22. Shadow price cannot be determined when one or more decision variables are integer.
(1 Point)

True

False

Go back to thank you page

This content is created by the owner of the form. The data you submit will be sent to the form owner. Microsoft is not responsible for
the privacy or security practices of its customers, including those of this form owner. Never give out your password.

Powered by Microsoft Forms | Privacy and cookies | Terms of use