MCA315 Computer Based Optimization Techniques MCA Question Bank : bbdnitm.ac.in

Name of the Institute : Babu Banarasi Das National Institute of Technology & Management
Degree : MCA
Department : Computer Applications
Subject Code/Name : (MCA-315) Computer Based Optimization Techniques
Year : 2nd
Semester : 3rd
Document Type : Question Bank
Website : bbdnitm.ac.in

Download Model/Sample Question Paper :https://www.pdfquestion.in/uploads/bbdnitm.ac.in/3155-QuestionBankMCA315ComputerBasedOptimizationTechniques.pdf

BBDBITM Optimization Techniques Question Paper

Unit I

1. Explain the various inventory model with suitable real life examples.

Related / Similar Question Paper : BBDNITM MCA Database Management System Question Bank

2. Briefly describe the procedure to select the best machine from the two available machines?
3. What do you mean by Replacement Problem also describe various types of failures?
4. Discuss Group Replacement and also State the Group Replacement Policy.
5. Discuss the concept of Price- Break and Briefly describe One and Two Price-Break with examples.

6. Briefly describe various kinds of inventories also differentiate between direct and indirect inventories?
7. Briefly describe the various costs involved in inventory management?
8. What do you understand by Inventory management also describe different types of Inventories.
9. What do you mean by EOQ also discuss at least three EOQ models.
10. Discuss the Economic lot size model with different rates of demands in different cycles.
11. How the gradual failure is different from sudden failure, explain with real life examples.
12. Discuss the multi-item deterministic models with constraints.

UNIT II

1. What do you mean by Artificial Variables, Discuss their role in the solution of L.P.P.
2. Briefly describe the steps to solve two variable L.P.P. using Graphical Method.
3. Discuss the various steps of Simplex algorithm in Detail.
4. Discuss the steps of Dual Simplex Method for solving Linear Programming Problem.
5. Explain the advantages of Revised Simplex Method over simplex method.
6. “In dual simplex we move from infeasibility to feasibility while in simplex we move towards optimality”, Explain.

UNIT III

1. What do you mean by Degeneracy in Transportation Problem, how can we remove it?
2. What do you understand by I.P.P. and how it different from L.P.P.
3. Discuss the step wise algorithm for All-Integer I.P.P. using Gomory‟s Cutting Plane Method.
4. “A necessary and sufficient condition for the existence of feasible solution of the transportation problem is sum of(ai) = Sum Of(bj) (i=1,2,…….m; j=1,2,…………..n)“, Prove it.
5. Describe the procedure to deal with unbalance Transportation and Assignment problems.
6. What do you mean by Assignment Problem, Also write the steps to find the optimal Assignment.

UNIT IV

1. State the kuhn-Tucker necessary and sufficient conditions.
2. Discuss the characteristics of Dynamic Programming Problem.
3. State the principle of Bellman‟s Optimality and also discuss its utility.
4. Discuss the various applications of Dynamic Programming Problem
5. What do you mean by Non Linear Programming Problems, Also discuss the Wolfe‟s Method.
6. Write the Kuhn-Tucker Conditions for Non Linear Programming Problems.
7. Discuss the steps of Wolfe‟s method to solve a quadratic programming problem.
8. Briefly describe the procedure to solve a quadratic programming problem using Beale‟s method

UNIT V

1. Discuss the concept of Queues in Operations Research through some real life examples.
2. Why the Exponential Distribution is known as Memory Less Distribution, Explain.
3. Discuss the Erlang distribution in Queuing theory, Also write its mean, Variance and Probability Density Function
4. Discuss the Service-time distribution in Queuing theory.
5. Discuss the Kendall‟s Notations for representing Queuing Models.
6. Briefly describe the basic elements of Queuing Model.
7. Explain the Pure-Birth or Poisson Process of queuing theory.
8. “If number of arrivals in time t follow Poisson distribution then the inter-arrival time will follow negative exponential law”, Prove it.
9. Differentiate between Steady and Transient States, also describe the concept of Traffic Intensity.
10. State and prove the Markovian property of inter-arrival time.
11. Establish the formula to find the expected waiting time in the queue (excluding the service time) (Wq).
12. Discuss the inter-relationship among Ls, Lq, Ws and Wq.

(Long Answer Type Questions) :
UNIT I :
1. A manual stamper currently valued at Rs.1000 is expected to last 2 yearsand costs Rs.4000 per year to operate. An automatic stamper which can be purchased for Rs.3000 will last 4 years and can be operated at an annual cost of Rs.3000. If money carries the rate of interest 10% per year, determine which stamper should be purchased.
2. Explain the concept of Economic Order Quantity and discuss the models with and without shortages.

3. Briefly Describe the following :
a. Steady State
b. Transient State
c. Economic Order Quantity
d. Two Price Break
e. Present Worth Factor

4. A customer has to supply 10,000 bearings per day to an automobile company. He finds that when he starts a production run, he can produce 25000 bearings per day. The cost of holding a bearing in stock for one year is 20 paise and setup cost is Rs.180. How frequently should production run be made?
5. Explain the rules for determining the economic lot size in case of one and two price-break models.