27 views

Uploaded by SheryaBhatt

may paperr

- Scheduling Optimisation of Chemical Process Plant
- Step by Step Optimization S
- lindoapi
- Lingo 13 Users Manual
- Lecture 4 (Notes)
- operating room scheduliing
- Linear Programing
- Now Sath
- IRJET-A New Non-monotone Adaptive Trust Region Method for Unconstrained Optimization Problems
- Theory of the Simplex Method
- Deployment Optimization
- optimizing an advertising campaign
- LPSupplement
- EC 16 Bigproject Ch1618
- 18.PhD Thesis
- lec6
- Matlab Optimization Toolbox Mathworks.ir
- ch_9_1_2
- Lecture 5 (Notes)
- Session 3 & 4

You are on page 1of 2

: ________

Enrolment No.___________

BE - SEMESTERVI EXAMINATION WINTER 2014

Date: 05-12-2014

Subject Name: Modeling Simulation and Operation Research

Time: 02:30 pm - 05:00 pm

Total Marks: 70

Instructions:

1. Attempt all questions.

2. Make suitable assumptions wherever necessary.

3. Figures to the right indicate full marks.

Q.1

Q.2

Q.3

in Information and Technology application building.

(b) A company manufactures 3 types of parts which use precious metals

platinum and gold. Due to shortage of these precious metals, the

government regulates the amount that may be used per day. The relevant

data with respect to supply, requirements and profits are summarized in

the table as follows :

Product

Platinum required

Gold required

Profit/unit

unit (gms)

unit(gms)

(Rs.)

A

2

3

500

B

4

2

600

C

6

4

1200

Daily allotment of platinum and gold are 160gm and 120gm respectively.

How should company divide the supply of scarce precious metals?

Formulate it as a linear programming problem.

(C) Explain the steps followed to solve LPPs by graphical method.

(a) Solve this LPP problem graphically.

Maximize Z = X1 + 3X2

Subject to the constraint X1 + 2X2 9

X1 + 4X2 11

X1 - X2 2 and X1,X2 0

(b) Use simplex method to solve following LPPs

Maximize Z = 7X1+14X2

Subject to 3X1 + 2X2 <= 36, X1 + 4X2 <=10 X1 >=0 , X2>=0

OR

(b) Explain the concept and computational steps of the simplex method for

solving linear programming problem. How would you identify whether

an optimal solution to a problem obtained using simplex algorithm is

unique or not ?

07

04

03

07

07

07

(a) Discuss the Northwest and Least cost method for finding initial basic 07

solution. Give its advantage and disadvantage.

(b) Solve the transportation problem and obtain initial feasible solution 07

calculated by Vogels Approximation Method

D1

D2

D3

D4

D5

Supply

S1

4

2

3

2

6

8

S2

5

4

5

2

1

12

S3

6

5

4

7

7

10

Demand 4

4

6

8

8

OR

1

Q.3

Q.4

(a)

(a) Some assignment are prohibited ?

(b) The objective function is of maximization type ?

(b) ABC company is engaged in manufacturing 5 brands of packed snacks. It

has five manufacturing setups, each capable of manufacturing any of its

brands one at a time, The costs to make a brand on these setups vary

according to following table.

S1

S2

S3

S4

S5

B1

4

6

7

5

11

B2

7

3

6

9

5

B3

8

5

4

6

9

B4

9

12

7

11

10

B5

7

5

9

8

11

Find the optimum assignment on these setups resulting in the minimum

cost?

(a) What is critical path? State the necessary and sufficient condition of

critical path. Can a project have multiple critical path ?

(b) Consider the following data for the activity of the project:

Activity

1-2

1-3

1-4

2-5

3-6

3-7

4-6

5-8

6-9

7-8

Duratio

n

07

07

07

07

89

3

OR

Q.4

Q.5

Q.5

Technology filed.

(1) First come first served (2) Last come first served (3) Random

pick service

(b) At a certain petrol pump, customer arrives in a Poisson process with an

average time of five minutes between successive arrivals. The time taken

at the petrol pump to serve customers follows the exponential distribution

with an average of two minutes. You are required to obtain the following

:

(a) Arrival and service rate

(b) The utilization parameter

(c) Excepted queue length

(d) Expected number of customer in the system.

(a) A firm has a machine whose purchase price is Rs.20,000. Its maintenance

cost and resale price at the end of the different years are as given here:

Year

1

2

3

4

5

6

Maintenance 1500

1700

2000

2500

3500

5500

cost

Resale price 17000 15300 14000 12000 8000

3000

Obtain the economic life of the machine and the minimum average cost.

(b) What is simulation? Explain the process of simulation

OR

(a) Define the simulation model. Distinguish between deterministic and

stochastic simulation mode.

(b) Explain group replacement policy with suitable example.

07

07

07

07

07

07

*************

- Scheduling Optimisation of Chemical Process PlantUploaded byPrateikMenon
- Step by Step Optimization SUploaded byNopparut
- lindoapiUploaded bymoezboughalmi
- Lingo 13 Users ManualUploaded byAnonymous msVFza
- Lecture 4 (Notes)Uploaded byillustra7
- operating room scheduliingUploaded byAchmad P. Rifai
- Linear ProgramingUploaded byLuis Ivan
- Now SathUploaded bysanjay
- IRJET-A New Non-monotone Adaptive Trust Region Method for Unconstrained Optimization ProblemsUploaded byIRJET Journal
- Theory of the Simplex MethodUploaded bySandip Ghosh
- Deployment OptimizationUploaded bygenius1q2w
- optimizing an advertising campaignUploaded byapi-241793203
- LPSupplementUploaded byAnshul Sahni
- EC 16 Bigproject Ch1618Uploaded byArifa Nadeem
- 18.PhD ThesisUploaded byRam Nice
- lec6Uploaded byaneesullah
- Matlab Optimization Toolbox Mathworks.irUploaded byMohammad Reza Madadi
- ch_9_1_2Uploaded byslv_prasaad
- Lecture 5 (Notes)Uploaded byillustra7
- Session 3 & 4Uploaded byabhdon
- optimizing an advertising campaignUploaded byapi-302328122
- 1010 optimization projectUploaded byapi-308911099
- 1010 optimization projectUploaded byapi-308911099
- CloudOpt: Multi-Goal Optimization of Application Deployments across a CloudUploaded byDanielPosirca
- 37 Paper AskarbekPazylbekovUploaded byfgsdas
- 1313.pdfUploaded byalex240574
- Business Mathematics_Special ClassUploaded bysung hoo
- LP Objective Solution PracticeUploaded bySupriya Kadam Jagtap
- MSci331_Simplex and Big MUploaded byYusuf Hussein
- GIAN Programme OptimizationUploaded bySantu Bhuyan

- DominanceCheck'MishraUploaded byNguyen Trung Kien
- GS_EE210_F09_NguyenUploaded byPratik Talole
- Continuous and Discrete Signals and Systems - S. Soliman & M Srinath - SpanishUploaded byhops1
- AI Question BankUploaded bymusic12341234
- Survey Paper for Different Video Stabilization TechniquesUploaded byAnonymous kw8Yrp0R5r
- A Detecton Algorithm of Lpi Radar SignalsUploaded byanji.guvvala
- Matlab CodesUploaded byonlymag4u
- Matrix AlgorithmsUploaded byZachary Marion
- Article 31Uploaded bySumit Jadhav
- LICAUploaded bymunnap15
- Matrix TheoryUploaded byMuhammad Usuf
- analisis bublesortUploaded byEliel Macias Gomez
- SIFTUploaded byFikir Fikir
- Exercise 2Uploaded byBách Vũ Trọng
- The Quest for the Perfect ResamplerUploaded byyonodio
- Swept vs FftUploaded byAnonymous NzGbEc1Jyq
- Novel Approach for Symbol Timing Estimation Based on the Extended Zero-crossingUploaded byNguyen Anh Duc
- Mitra ThesisUploaded bySanghamitra Tripathy
- Secant MethodUploaded byAjitsingh Jagtap
- Abbott 1997Uploaded bySatyanarayana Lalam
- Cs1201 Design and Analysis of AlgorithmUploaded byvijay_sudha
- ch02_1Uploaded byCassey Toyu
- dcs12Uploaded byrishikesh_147
- GAN ReportUploaded bysenthilnathan
- 2 SamplingUploaded bySaradhi Thota
- geneticalgorithms-124130142809-phpapp02Uploaded byAbhishek Yadav
- Linear Convolution vs Circular Convolution in the DFTUploaded bya_alok25
- DFS Lecture 7 (1)Uploaded byBrajesh Tiwary
- EECS 490 Lecture16Uploaded bydwiutomoo
- Binary TreeUploaded bymrbkiter