Paper Code : DCS-211 Roll No :...
Time : 1 Hours ] [ Max. Marks : 60
Examination : JUNE 2020 2nd Year
Computer Based Optimization Techniques
Instructions :-
Attempt All Questions. All questions carry equal marks.
Fill the 'Bubble' available in OMR Sheet to mark your Answer.
Only one option is correct out of all available option.
There is 1 mark for correct answer.
There is No Negative marking for incorrect answer.
1. The costs associated with inventory is/are:
(A) Purchase price of the inventory (B) Re-order costs
(C) Inventory holding costs, Shortage costs (D) All
2. For the purpose of Economic order quantity (EOQ) the relevant costs are:
(A) The annual holding cost per item per annum (B) The annual ordering costs
(C) Both A and B (D) None
3. Which of the following is not one of the assumptions of the basic EOQ model?
(A) Demand rates are constant (B) Orders arrive just when desired
(C) Each order is received in a single delivery (D) Quantity discounts are available
4. Which of the following is not considered a holding cost?
(A) Interest and depreciation (B) Stockout cost
(C) Opportunity cost.
(D) Insurance
5. The objective of good inventory management is to determine:
(A) The optimum re-order level
(B) How many items are left in inventory when the next order is placed
(C) The optimum re-order quantity – how many items should be ordered when the order is placed for all material inventory items.
(D) all
6. In the economic order quantity or EOQ model the equation (Q/2) × CH calculates:
(A) The number of orders each year (B) The total holding costs each year (C) Total ordering costs each year (D) Both A and C
7. In the basic EOQ model, annual setup cost is equal to:
(A) the EOQ multiplied by setup cost.
(B) the EOQ divided by setup cost
(C) setup cost multiplied by the ratio of the annual demand to the EOQ (D) setup cost multiplied by the ratio of the EOQ to annual demand 8. Simplex method was designed by ___________.
(A) Dantzig
(B) A.Charnes (C) Lemke (D) Hungarian
9. One of the techniques developed for solution of non linear programming is?
(A) Single programming (B) Multilinear propramming (C) Reverse programming (D) Dynamic programming
10. In the basic EOQ model, if annual demand doubles what is the effect on the EOQ?
(A) It doubles
(B) It is four times its previous amount (C) It increases by about 40%
(D) It is half its previous amount
11. In the EOQ model with quantity discounts, with holding cost stated as a percentage of unit purchase price, in order for the EOQ of the lowest curve to be optimum, it must:
(A) have the lowest total cost (B) be in a feasible range
(C) be to the left of the pricebreak quantity for that price (D) have the largest quantity compared to other EOQs
12. In the basic EOQ model, if D=60 per month, K=Rs 12, and h=Rs 10 per unit per month, EOQ is:
(A) 10 (B) 12 (C) 24 (D) 72
13. Maximization assignment problem is transformed into a minimization problem by_________.
(A) adding each entry in a column from the maximum value in that column (B) subtracting each entry in a column from the maximum value in that column (C) subtracting each entry in the table from the maximum value in that table (D) adding each entry in the table from the maximum value in that table
14. Which of the following method is used to solve Linear programming problems?
(A) Revised simplex method (B) Termed method
(C) Moment derivation method (D) Hollow method
15. Which of the following methods is used to verify the optimality of the current solution of the transportation problem_________.
(A) Modified Distribution Method (B) Least Cost Method
(C) Vogels Approximation Method (D) North West Corner Rule
16. Which of the following is not true for the EOQ model with gradual replenishment?
(A) Demand is constant
(B) Production rate exceeds usage rate (C) Run size exceeds maximum inventory.
(D) There are no setup costs
17. During iteration while moving from one solution to the next, degeneracy may occur when_______.
(A) the closed path indicates a diagonal move
(B) two or more occupied cells are on the closed path but neither of them represents a corner of the path.
(C) two or more occupied cells on the closed path with minus sigh are tied for lowest circled value.
(D) the closed path indicates a rectangle move.
18. In dynamic programming, the output to stage n become the input to:
(A) stage n-1 (B) stage n itself (C) stage n+1 (D) stage n-2
19. Why Mathematical model of linear programming problem is important?
(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
20. Which of the following is not a step in the Hungarian method of assignment?
(A) enumerate all possible solutions (B) revise the opportunity-cost table (C) find the opportunity-cost table (D) test for an optimal assignment
21. Dynamic programming divides problems into a number of (A) conflicting objective functions.
(B) decision stages (C) unrelated constraints (D) policies
22. If, when we are using a Simplex table to solve a maximization problem, we find that the ratios for determining the pivot row are all negative, then we know that the solution is:
(A) unbounded (B) infeasible (C) degenerate (D) optimal
23. The total cost of a queuing system is typically calculated as the : (A) waiting cost
(B) service cost
(C) sum of waiting cost and service cost
(D) difference of the waiting cost and service cost
24. In the standard queuing model, we assume that the queue discipline is ____________.
(A) first-come-first-served (B) last-in-first-served (C) random
(D) Planned
25. Linear Programming Problem is a technique of finding the ____________.
(A) optimal value (B) approximate value (C) initial value (D) infeasible value
26. The relationship between stages of a dynamic programming problem is called a(n) (A) state
(B) random variable (C) node
(D) Transformation
27. The service time in most basic queuing models is assumed to be ___________
(A) exponentially distributed (B) normally distributed (C) arbitrarily distributed (D) curve distributed
28. In most basic queuing models, the size of the arrival population is assumed to be ____________.
(A) infinite (B) finite (C) constant (D) none
29. NLP includes problems:
(A) in which the objective function is linear but some constraints are not linear.
(B) in which the constraints are linear but the objective function is not linear.
(C) in which both the objective function and all the constraints are not linear.
(D) all of the above.
30. At any iteration of the usual simplex method, if there is at least one basic variable in the basis at zero level and all the index numbers are non-negative, the current solution is_____.
(A) degenerate (B) non-degenerate (C) basic solution (D) non-basic solution
31. Which of the follwing is solvable by quadratic programming?
(A) LPP (B) NLP (C) TP
(D) Assignment problems
32. Using the graphical solution procedure to solve a maximization problem requires that we:
(A) move the level profit line up until it no longer intersects with any constraint equation.
(B) move the level profit line down until it no longer intersects with any constraint equation.
(C) apply the method of simultaneous equations to solve for the intersections of constraints.
(D) find the value of the objective functions at the origin.
33. Which of the following is known as the average number of customers in the queue waiting to get service?
(A) queue length (B) System length (C) Server idle time (D) Waiting time in queue
34. Which of the following enable the analyst to study the effect of manipulating decision variables on the operating characteristics of a service system.
(A) Linear programming (B) Queuing models (C) Dynamic Programming (D) Transportation model
35. If the supply lead time is certain and demand during the lead time is constant, a company would be able to set a reorder level such that it used the last item just as a new order arrived thus reducing holding costs to a minimum. The reorder level to do t
(A) Maximum demand for the material item per day/week × Maximum supply lead time in days/weeks (B) Demand for the material item per day/week × Lead time in days/weeks
(C) Both A and B (D) None
36. To resolve degeneracy at the initial solution, a very small quantity is allocated in ____________ cell.
(A) occupied (B) basic (C) non-basic (D) unoccupied
37. The queuing models are categorized as : (A) deterministic
(B) probabilistic (C) Both A and B (D) None
38. Which of the following method is used to solve the assignment problem?
(A) Transportation method and Hungarian method (B) Simplex Method
(C) Both A and B (D) None
39. VAM stands for___________
(A) Vogeal’s Approximation Method (B) Vogel’s Approximate Method (C) Vangel’s Approximation Method (D) Vogel’s Approximation Method
40. Which of the following is known the relative frequency with which the service system is idle which is directly related to cost.?
(A) queue length (B) System length (C) Server idle time (D) Waiting time in queue
41. State which of the two statements is correct (i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
(A) One only (B) Two only
(C) both (i) and (ii) are correct (D) Both (i) and (ii) are incorrect
42. In which phase is optimization done and how does that phase also checks for optimality conditions?
(A) Phase I (B) Phase II (C) Phase III (D) None
43. state which statement is incorrect. (i) Linear programming was first formulated by an English economist L.V. Kantorovich (ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions.
(A) (ii) only (B) (i) only
(C) Both (i) and( ii) (D) Both are correct
44. Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by the graphical method.
(A) One decision (B) Four decisions (C) Three decisions (D) Two decisions
45. An assignment problem is a particular case of ____________.
(A) linear programming problem (B) transportation problem (C) replacement problem (D) network problem
46. Which of the following can be used to solve transportation problems?
(A) The simplex method
(B) The transportation simplex method
(C) The network simplex method (D) all
47. In simplex algorithm , which method is used to deal with the situation where an infeasible starting basic solution is given?
(A) Slack variable (B) Simplex method (C) M‐ method (D) None
48. A feasible solution to a linear programming problem _____.
(A) must satisfy all the constraints of the problem 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
49. Which of the following are assumptions or requirements of transportation problems? I Goods are the same, regardless of source. II There must be a single source. III Minimum quantities must
(A) I and IV (B) II and III (C) I, II and IV (D) I and III
50. Which of the following is known the average number of customers in the system waiting to be served and those being served?
(A) queue length (B) System length (C) Server idle time (D) Waiting time in queue
51. The solution of any transportation problem is obtained in how many stages?
(A) Five (B) Four (C) Three (D) Two
52. Chose the correct statement about a degenerate solution.
(A) gives an optimum solution to the Linear Programming Problem (B) gives zero value to one or more of the basic variables
(C) yields more than one way to achieve the objective (D) makes use of all available resources
53. State which statement is true. (i) All linear programming problems may not have unique solutions (ii) The artificial variable technique is not a device that does not get the starting basic feasible solution.
(A) Both (i) and( ii) (B) (ii) only (C) (i) only
(D) Both are incorrect
54. Which of the following is another method to solve a given LPP involving some artificial variable ? (A) Big M method
(B) Method of penalties (C) Two‐phase simplex method (D) None of the above
55. Which of the following is known as is the average time that a customer has to wait in the queue to get service.?
(A) queue length (B) System length (C) Server idle time (D) Waiting time in queue
56. Which of the following is not an assumption in common queuing mathematical models?
(A) Arrivals come from an infinite or very large population.
(B) Arrivals are treated on a first-in, first-out basis.
(C) Customers do not balk or renege.
(D) The average arrival rate is faster than the average service rate.
57. Who originally called it ‘ Programming of interdependent activities in a linear structure’ but later shortened it to ‘ Linear Programming’ ?
(A) Dantzig (B) Kantorovich (C) Marshall (D) None
58. LPP is exactly used in solving what kind of resource allocation problems?
(A) Production planning and scheduling (B) Transportation
(C) Sales and advertising (D) All of the above
59. Which of the following is the fastest algorithm for solving an assignment problem?
(A) The simplex method.
(B) The Hungarian method.
(C) The network simplex method.
(D) The transportation simplex method
60. Which of the following is not a key operating characteristic for a queuing system?
(A) Utilization rate (B) Percentage idle time
(C) Average time spent waiting in the system and in the queue (D) none
