Scribd
Upload
56 views2 pages

Systematic Procedure To Problem Solving by An Operation Research Team. (2) Degeneracy and Cycling in Linear Programming Problem

The document contains 30 questions related to operations research concepts including methodology of operations research, network creation rules, systematic problem solving procedures, assignment algorithm differences between CPM and PERT, Monte Carlo simulation random number generation, queuing system characteristics and models, individual vs group replacement, minimal spanning tree determination procedure, operation research definition and characteristics, CPM and LPP definitions, BIG-M method, transportation problem formulation, assignment vs transportation problems, replacement problems and situations, simulation advantages and limitations, queue elements and applications, queuing theory phases, queuing process components and examples, birth and death processes, simplex procedure slack surplus and artificial variables, feasible basic and optimal solutions, two phase method example, shortest route problem applications, assignment problem

Uploaded by

Lokesh Gagnani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
56 views2 pages

Systematic Procedure To Problem Solving by An Operation Research Team. (2) Degeneracy and Cycling in Linear Programming Problem

The document contains 30 questions related to operations research concepts including methodology of operations research, network creation rules, systematic problem solving procedures, assignment algorithm differences between CPM and PERT, Monte Carlo simulation random number generation, queuing system characteristics and models, individual vs group replacement, minimal spanning tree determination procedure, operation research definition and characteristics, CPM and LPP definitions, BIG-M method, transportation problem formulation, assignment vs transportation problems, replacement problems and situations, simulation advantages and limitations, queue elements and applications, queuing theory phases, queuing process components and examples, birth and death processes, simplex procedure slack surplus and artificial variables, feasible basic and optimal solutions, two phase method example, shortest route problem applications, assignment problem

Uploaded by

Lokesh Gagnani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

KALOL INSTITUTE OF TECHNOLOGY & RESEARCH CENTRE, KALOL QUESTION BANK-I (Theoretical Questions) MODELING SIMULATION & OPERATION

RESEARCH (BE 6th Semester IT) [161601]

Q-1 Discuss methodology of Operation Research?


Q-2 Discuss various rules for network creation?

Q-3 Explain the followings. (1) Systematic procedure to problem solving by an operation research team. (2) Degeneracy and cycling in linear programming problem Q-4 Write notes on the following topics. (1) Assignment Algorithm (2) Differences between CPM and PERT.
Q-5 What is Monte-Carlo Simulation? Explain any two methods for random number generation Q-6 Explain Characteristics of the queuing system. Explain the queuing models indicated by the following notations. I) (M/D/1): (FCFS//) II) (M/M/1): (FCFS/N/N) III) (D/D/1): (FCFS//) Q-7 Explain Individual replacement versus group replacement. Q-8 Explain the procedure for determining Minimal Spanning tree Q-9 Define Operation Research. Write Characteristics and limitation of Operation Research. Q-10 Define (1) C.P.M (2) L.P.P Q-11 Explain BIG-M Method with suitable example Q-12 (i) Describe the Transportation problem and give its mathematical model. (ii) Write a note on tracing a closed loop. What are the Characteristics features of a closed loop? Q-13 What is an assignment model? Explain difference between transportation and an assignment problem Q-14 What is a replacement problem? Describe some important replacement situation. Also discuss group replacement problem Q-15 What is simulation? What are the advantages and limitations of simulation? Q-16 What is queue? Explain basic element of queues. Give some application of queuing theory. Q.17 Explain the phases of a simulation model.

Q.18 What is the queuing theory? What are the components of the Basic Queuing Process, explain Arrival Process with example Q-19 Define with diagram: Birth Process & Death Process. Explain the characteristics of a queuing model? Q.20 What is the function of slack, surplus and artificial variables in simplex procedure of LPP? Q.21Write the difference between a feasible solution, a basic feasible solution and an optimal solution of linear programming problem. Q.22 Discuss Two phase method with example in brief. Q.23 Explain shortest route problem with its applications Q.24 Discuss assignment problem in brief. Enlist the various methods for solving the assignment problem and explain any one in detail. Q.25 Explain the types of queuing system with usage of six character code Q.26 Write short note on: - Exponential Distribution and - Birth and Death Process Q.27 (1) Explain benefits of better resource allocation. (2) Explain (i) first-come-first-served and (ii) priority service in concerned with queuing structure Q.28 Explain the replacement problem or strategy. Describe some important replacement situations and policies? Q.29 Discuss various Queuing models. Also state the scope and applicability of queuing theory? Q.30 Discuss the term simulation and modeling? Prepared By: Prof. Lokesh Gagnani (IT Dept)

You might also like