# MCQ on Optimization Techniques

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

01). If the kth constraint of the primal problem is 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.

02). The method used to solve LPP without artificial variables is called the _ ____ method.

(a) Simplex method
(b) Dual Simplex method
(c) artificial variable method.
(d) none of the above

03). 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.

04). Degeneracy in a m X n transportation problem occurs when the number of occupied cells is less than ______.

(a) m+n
(b) m+n+1
(c) m+n-1
(d) m—n+1

05).The formula for calculating expected time in PERT is ________.

06). The total float of an activity 3-4 is 18 and the latest and earliest occurrences of the events 3 and 4 are 15, 12 and 22, 10 respectively, what is the free float of 3-4.

(a) 4
(b) 7
(c) 6
(d) 10

(a) Total float – slack of tail event
(b) Total float – LFT of head event
(c) Total float – EFT of head event
(d) Total float – Slack of head event.

08). If all paths of a network are critical paths then the project duration cannot be reduced further.

(a) true
(b) false
(c) nothing can be said
(d) none of the above

09). 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.

10). 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.

11). Geometrically the branching process in branch and bound technique

(a) eliminates that portion of the non-feasible region.
(b) does not eliminate that portion of the feasible region that contains no feasible Integer solution.
(c) eliminate that portion of the feasible region that contains no feasible integer solution.
(d) none of the above

12). Economic order quantity results in

(a) Reduced stock outs
(b) equalization of carrying cost and procurement cost
(c) favourable procurement price
(d) none of the above.

13). The formula for EOQ under purchasing model without shortages is

14). For an item with storage cost of each item Rs.1, set up cost Rs.25, demand200unitpermonthCmin is

(a) Rs.100
(b)Rs.400
(c) Rs.500
(d) Rs.300

15). A company uses 10,000 units per year of an item. The purchase price is one rupee per item. Ordering cost=Rs.25 per order. Carrying cost 12% of the inventory value. The EOQ is

(a) 2086 units
(b) 2085 units
(c) 2083 units
(d) 2084 units

16). Minimum inventory equals

(a) EOQ
(b) Reorder level
(c) Safety stock
(d)Excess stock

17). (M/M/1) model is known as

(a) Poisson model
(b) Birth death model
(c) Exponential model
(d) multiserver model.

18). The time interval between consecutive arrivals generally follows ___ distribution.

(a) Normal distribution
(b) Poisson distribution
(c) Exponential Distribution
(d)Rectangular distribution

19). The utilization factor under the multi-server model is

20). The formula for the length of the system under (M/M/1):(N/FIFO)