Scribd
Upload
46 views2 pages

Operation Research (Elective II)

This document outlines a course on Operation Research with a focus on various optimization techniques including the simplex method, dual simplex method, and dynamic programming. It includes ten questions that cover topics such as linear programming, transportation problems, project management using PERT, and network diagrams. The course has specific submission deadlines and grading criteria.

Uploaded by

Gayathri Krithika
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
46 views2 pages

Operation Research (Elective II)

This document outlines a course on Operation Research with a focus on various optimization techniques including the simplex method, dual simplex method, and dynamic programming. It includes ten questions that cover topics such as linear programming, transportation problems, project management using PERT, and network diagrams. The course has specific submission deadlines and grading criteria.

Uploaded by

Gayathri Krithika
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

Course Code: 4MSCM4

Course: Operation research


Credit: 4
Last Submission Date: October 31, (for January session)
April 30 (for July Session)

Max. Marks:-70
Min. Marks:-25
Note:-Attempt all questions.

Que.1 Solve the following by simplex method


Maximum: Z=2x1 + 3x2
s.t.c. x1 +5x2 15
2x1 +x2 10
& x1 ,x2 0
Que.2 Write the dual of the following L.P.P
Maximum Z= x1 + 2x2 + x3
s.t.c. 2x1 +x2 -x3 2
2x1 – x2 + 5x3
4x1 +x2 + x3 6
& x1 , x2 , x3
Que.3 Use dual simplex method to
Maximize Z= -3x1 -2x2
Subject to x1 +x2 1
x1 +x2 7
x1 + 2x2
x2
& x1 ,x2
Que.4 A company manufactures two products , radios and transistors, which must be
processed through assembly and finishing department . Assembly has go hours
available, finishing can handle up to 72hours of work . Manufacturing one radio
requires 6 hours in assembly and 3 hours in finishing . Each transistor requires 3
hours in assembly and 6 hours in finishing if profit is Rs. 120 per radio and Rs. 90
per transistor, determine the best combination of radios and transistors to realize
profit of Rs. 2100.
Que.5 Find the optimum solution to the following transportation problem in which the
cells contain the transportation cost in rupees.

W1 W2 W3 W4 W5 Available
F1 7 6 4 5 9 40
F2 8 5 6 7 8 30
F3 6 8 9 6 5 20
F4 5 7 7 8 6 10
Required 30 30 15 20 5 100 (Total)

Que.6 Five wagons are available at stations 1,2,3,4 & , these are required at five stations
I, II , III IV, V . The mileages between various stations are given by the table
below. How should be the wagons be transported so as to minimize the total
mileage covered .

I II III IV V
1 10 5 9 18 11

2 13 9 6 12 14

3 3 2 4 4 5
18 9 12 17 15
4
5 11 6 14 19 10

Que.7 A project consists of a series of tasks labelled A,B -------, H,I with the following
relationships (W<X, Y means X and Y can not start until W is completed ; X,Y<W
means W can not start until both X and Y are completed). With this notation
construct the network diagram having the following constraints:
A<D, E; B,D<F; C<G; B<H; F,G< I.
Que.8 The time estimates (in weeks) for the activities of a PERT network are given below:

Activity t0 tm tp

1-2 1 1 7
1-3 1 4 7
1-4 2 2 8
2-5 1 1 1
3-5 2 5 14
4-6 2 5 8
5-6 3 6 15
Draw the project network and identify all paths through it.
Que.9 Solve by dynamic programming:
Maximize Z= 2x1 + 5x2
Subject to 2x1 + x2 430
2x2 460
X1 , X2 0
Que.10 Use dynamic programming to show that .log pi subject to the constraint
=1 , pi 0 for all i is minimum when p1 =p1 -------pn = .

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy