This document contains information about an operations research exam for a postgraduate program including:
1) Section A contains short questions on operations research principles like dominance, phases in OR, queue disciplines, and sensitivity analysis.
2) Section B contains four long-answer questions related to replacement situations, job sequencing on machines to minimize elapsed time, differences between transportation and assignment problems, and uses of linear programming and network techniques.
3) Section C contains a transportation problem to minimize costs in routing output from manufacturing plants to warehouses across different locations.
This document contains information about an operations research exam for a postgraduate program including:
1) Section A contains short questions on operations research principles like dominance, phases in OR, queue disciplines, and sensitivity analysis.
2) Section B contains four long-answer questions related to replacement situations, job sequencing on machines to minimize elapsed time, differences between transportation and assignment problems, and uses of linear programming and network techniques.
3) Section C contains a transportation problem to minimize costs in routing output from manufacturing plants to warehouses across different locations.
This document contains information about an operations research exam for a postgraduate program including:
1) Section A contains short questions on operations research principles like dominance, phases in OR, queue disciplines, and sensitivity analysis.
2) Section B contains four long-answer questions related to replacement situations, job sequencing on machines to minimize elapsed time, differences between transportation and assignment problems, and uses of linear programming and network techniques.
3) Section C contains a transportation problem to minimize costs in routing output from manufacturing plants to warehouses across different locations.
Tim-3 !"#$% M&M&-'0 N"() T!i% *#%(i"n P+,$ -"n%i%(% ". (!$ S-(i"n%& S-(i"n A i% ". 10 M+$/%& S-(i"n 0 i% ". 40 M+$/% +nd S-(i"n C i% ". 20 M+$/%& SECTION A A11 *#%(i"n% +$ -"m,#1%"$2 (2 X 3 4 10) M+$/% Write short note on 1) Principle of dominance 2) Phases in operations research 3) Queue discipline 4) Sensitivity analysis 5) Artificial variable SECTION 0 A((m,( +n2 FOUR *#%(i"n% (10 X 4 4 40) M+$/% ! What is replacement" #escribe some important replacement situations! $! %here are seven &obs that have to 'o on machine A and (! Processin' time in hours for &obs on machines A and ( are 'iven belo) M+-!in 51 52 53 54 53 56 5' A 3 12 15 1* 11 + 0 , 1* 1* 12 1 3 #etermine a se-uence of these &obs that )ill minimi.e the total elapsed time %! Also find % and the idle time for the machine A and (! ,! /0plain the difference bet)een a transportation problem and an assi'nment problem! +! 1o) are P/2% and 3P4 techni-ues useful in mana'erial decision ma5in'" 1*! %he pay6off matri0 of a 'ame is 'iven belo)! 7ind the best strate'y for each player and the value of a play of the 'ame to A and (! 0 I II III I7 7 I A II III I7 + 3 1 , * 5 4 $ 2 4 3 3 , 5 2 2 1 SECTION C (20) M+$/% 11! A firm o)ns facilities at seven places! 8t has manufacturin' plants at places A9 (9 and 3 )ith a daily output of **9 4** and 3** units respectively! 8t has )arehouses at places P9 Q 2 and S )ith daily re-uirements of 23*9 2**9 45* and 42* units9 respectively! Per unit shippin' costs on different route combinations are sho)n belo)! F$"m8T" P * R S A 12 1* 12 13 0 $ 11 , 14 C 1 11 $ %he firm )ants to send the output from various plants to )arehouses involvin' minimum transportation costs! 1o) should it route its product to achieve its ob&ective"