operation research question paper 2019

• [email protected]

Previous year question paper for OR (BBA 3rd)

Operation Research

Previous year question paper with solutions for operation research from 2017 to 2021.

Our website provides solved previous year question paper for Operation Research from 2017 to 2021. Doing preparation from the previous year question paper helps you to get good marks in exams. From our OR question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

OR (Dec 2021)

Or (dec 2020), or (dec 2019), or (dec 2018), or (dec 2017), related subjects, explore all data.

• BA-HONS-ECON |
• BA-HONS-SS |
• MA-Punjabi |
• MA-English |
• MA-History |
• MBA-Executive |
• MCOM-MEFB |
• MSC-Chemistry |
• MSC-Physics |
• MSC-Botany |
• MSC-Zoology |
• MA-Economics |
• ME-CHEMICAL |
• ME-ELECTRIC |
• M.TECH-ME |
• M.TECH-NN |
• BCOM-HONS |
• MSC-physics |
• BA-ENGLISH |
• MSC-chemistry |
• MSC-maths |
• BSC-Medical |
• BSC-Hons-BT |
• BSC-Hons-Math |

PSEB(School)

Cbse(school), ptu distance education.

Academia.edu no longer supports Internet Explorer.

To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to  upgrade your browser .

Enter the email address you signed up with and we'll email you a reset link.

• We're Hiring!
• Help Center

QUESTION BANK ON OPERATIONS RESEARCH UNIT-1: Basics of operations research

•   We're Hiring!
•   Help Center
• Find new research papers in:
• Health Sciences
• Earth Sciences
• Cognitive Science
• Mathematics
• Computer Science
• Academia ©2024

• Privacy Policy

• Anna University
• Bharathiar University
• Gauhati University
• Calicut University
• Kakatiya University
• Punjabi University
• MG University
• RGPV Bhopal
• TNPSC / VAO
• 2017 Question Papers
• 2016 Question Papers
• 2015 Question Papers
• 2014 Question Papers
• 2013 Question Papers

Tuesday, March 2, 2021

Anna university ba 5201-applied operations research november/december 2019 question paper.

 Anna University Previous Years Old Question Papers

Question Paper Code: 70163

M.B.A.  DEGREE EXAMINATION, NOVEMBER/DECEMBER 2019

Second Semester

BA 5201-APPLIED OPERATIONS RESEARCH 

(Regulation 2017)

Time: Three hours

Maximum: 100 marks

Attachment Type: PDF and Images

PDF Download:  Click Here to Anna University  BA 5201-APPLIED OPERATIONS RESEARCH   NOVEMBER/DECEMBER 2019 Question Paper 

Question Paper Scanned Images Download  

Little star

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as www.IndianUniversityQuestionPapers.com . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!

0 comments:

Pen down your valuable important comments below

Search Everything Here

Send question papers and get paid. click here to send qp by whatsapp, sponsored link, popular posts.

• University of Rajasthan (Uniraj) Old Question Papers Are you searching for old question papers of Uniraj? Model Question Papers of Uniraj? Uniraj Previous Years Question Papers? Sample Questio...

Free E-Mail Alert for Latest Exam Papers

Join Us on Facebook / Google Plus

Subscribe free updates on your email | rss.

Blog Archive

• April 2024 (84)
• March 2024 (54)
• February 2024 (400)
• January 2024 (347)
• December 2023 (410)
• November 2023 (416)
• October 2023 (422)
• September 2023 (420)
• August 2023 (300)
• July 2023 (420)
• June 2023 (418)
• May 2023 (431)
• April 2023 (436)
• March 2023 (371)
• February 2023 (272)
• January 2023 (461)
• December 2022 (430)
• November 2022 (448)
• October 2022 (454)
• September 2022 (510)
• August 2022 (1064)
• July 2022 (1185)
• June 2022 (718)
• May 2022 (735)
• April 2022 (907)
• March 2022 (1153)
• February 2022 (820)
• January 2022 (702)
• December 2021 (504)
• November 2021 (413)
• October 2021 (556)
• September 2021 (1085)
• August 2021 (966)
• July 2021 (991)
• June 2021 (815)
• May 2021 (973)
• April 2021 (802)
• March 2021 (840)
• February 2021 (740)
• January 2021 (467)
• December 2020 (10)
• February 2020 (13)
• January 2020 (11)
• November 2019 (4)
• June 2019 (5)
• May 2019 (5)
• September 2018 (4)
• August 2018 (3)
• June 2018 (1)
• May 2018 (2)
• April 2018 (1)
• March 2018 (1)
• February 2018 (2)
• January 2018 (1)
• December 2017 (21)
• November 2017 (24)
• October 2017 (68)
• September 2017 (3)
• August 2017 (6)
• July 2017 (44)
• June 2017 (8)
• May 2017 (2)
• April 2017 (2)
• March 2017 (9)
• February 2017 (5)
• January 2017 (14)
• December 2016 (114)
• November 2016 (264)
• October 2016 (302)
• September 2016 (189)
• August 2016 (223)
• July 2016 (216)
• June 2016 (47)
• May 2016 (65)
• April 2016 (83)
• March 2016 (90)
• February 2016 (274)
• January 2016 (748)
• December 2015 (1696)
• November 2015 (1389)
• October 2015 (545)
• September 2015 (130)
• August 2015 (38)
• July 2015 (766)
• June 2015 (421)
• May 2015 (315)
• April 2015 (93)
• March 2015 (160)
• February 2015 (85)
• January 2015 (30)
• December 2014 (118)
• November 2014 (112)
• October 2014 (59)
• September 2014 (12)
• August 2014 (5)
• July 2014 (12)
• June 2014 (37)
• May 2014 (98)
• April 2014 (81)
• March 2014 (9)
• February 2014 (26)
• January 2014 (85)
• December 2013 (62)
• November 2013 (50)
• September 2013 (27)
• August 2013 (1)
• June 2013 (21)

VTU Operations Research Question Papers 8th sem ME 2015 CBCS scheme

15ME81 Question Paper

VTU Operations Research AUG 2022 Question Paper

Operations research question papers, vtu operations research jan 2020 question paper, vtu operations research july 2019 question paper, vtu operations research mar 2022 question paper, vtu operations research nov 2020 question paper, last updated : monday january 23, 2023.

• VTU last year question papers
• VTU E Learning
• VTU Time Table New
• Model Question Papers New
• VTU Syllabus New
• VTU Results
• VTU Question Bank
• VTU Revaluation Results
• SGPA to Percentage

VTU Updates

• VTU NON-CBCS Results New
• SSP Scholarship 2023 New
• Cloud Computing vtu question papers New
• Machine Learning Syllabus New
• 18CS71-AiML VTU Question Papers New
• Machine Learning VTU Question Papers New
• Web Technology Syllabus New
• VTU change of college Procedure New
• VTU MTech Syllabus New
• VTU MBA Results New
• VTU Notes New
• VTU PhD TimeTable New
• VTU Academic Calendar 2023 Odd Sem
• VTU Updates New
• Infosys Recruitment 2022 New
• Cyber Security Syllabus New
• MBA in USA for Engineering Students New

OPERATIONS RESEARCH Old question papers downloadOPERATIONS RESEARCH R16 Regulation B.Tech JNTUK-kakinada Old question papers previous question papers download

OPERATIONS RESEARCH Old question papers downloadOPERATIONS RESEARCH,R16 Regulation, B.Tech , JNTUK,OLD Question papers, Previous ,Question , papers, download, R16, R13, R10, R07

If you have any old question paper not updated on our website please send email to [email protected] with question paper as attachment.

Jntuh old question papers click here, for other subject question papers click here, if you don't find something you are searching for contact us.

MJPRU Question Paper

Download bba 4 sem operations research 21225 2019, question paper links, important links, examination links.

• Privacy Policy

• HSC SYLLABUS SOLUTION
• _BK & ACCOUNT
• __Super30 Adjustment
• __Final Account
• __Not For Profit Concerned
• __Admission of Partnership
• __Retirement of Partnership
• __Death of Partnership
• __Dissolution of Partnership
• __Bill of Exchange
• __Issue of Share
• _Maths & Stats
• __Commission, Brokerage & Discount
• __Insurance & Annuity
• _HSC Board Exam Q.P.
• __Economic QP 2022
• __Economic QP 2023
• __OCM QP 2022
• __OCM QP 2023
• _Bk & Accountancy
• __Meaning & Fundamental of Double Entry Book-Keeping
• __Basic Concepts in Economics
• __Chapter 1.1 Being Neighborly
• __Chapter 1.3 The Call of the Soil -A Scent of Rice
• __Chapter 1.4 Pillars of Democracy - Dr. Babasaheb Ambedkar
• __Ch 2.3 There is Another Sky by Emily Dickinson
• __Ch 2.4 Upon Westminster Bridge
• __Chapter 3.2 Blog Writing
• __Chapter 3.5 Film Review
• __Chapter 4.1 History of English Drama
• TYBCOM SEM-6
• _Financial Accounting
• __BuyBack of Equity Share
• __Capital Reduction and Internal Reconstruction
• _Cost Accounting
• __Contract Costing
• __Cost Control Account
• __Process Costing
• __Marginal Costing

TYBMS Semester 6 Operation Research (Q.P. April 2019 with Solution)

 paper/ subject code 86001/ operation research, tybms semester 6 operation research , (q.p. april 2019 with solution), 1) april 2019 q.p. with   solution (pdf) , 2) november 2019 q.p. with  solution (pdf), 4 ) april 2023 q.p. with  solution (pdf).

Please check whether you have got the right question paper.

1. All questions are compulsory. (Subject to Internal Choice)

2. Figures to the right indicate full marks

3. Use of non-programmable calculator is allowed and mobile phones are not allowed.

4. Normal distribution table is printed on the last page for reference. Support your answers with diagrams / illustrations, wherever necessary

6. Graph papers will be supplied on request.

___________________________________________________________________________

Q1.A) Multiple choice questions (Attempt Any 8)                                                  (8)

I) ln linear programming, unbounded solution means ____________. .

a) infeasible solution   b) Degenerate solution

c) Infinite solutions     d) Unique solution

  Ans:  c) Infinite solutions

Ii) if m + n-1 = number of allocations in transportation, it means _________..

(Where 'M' is number of rows and N' is number of columns)

a) There is no degeneracy       b) Problem is unbalanced

c) Problem is degenerate        d) Solution is optimal

 Ans:  a) There is no degeneracy   

Ijü) floats for critical activities will be always _________________..

a) One             b) Zero

c) Highest        d) Same ás duration of the activity

 Ans:  b) Zero

Iv) the total time required to complete all the jobs-in a job sequencing problem is known as __________,.

a) Idle time                                 b) Processing time

c)Elapsed time                        d) Processing order

 Ans:  c)Elapsed time

V) in linear programming, _____________ represents mathematical equation of the limitations imposed by the problem..

a) Objective function              b) Decision variable

c)Redundancy                         d) Constraints

Ans:    d) Constraints

Vi) if in an assignment problem, number of rows is not equal to number of columns then ____________..

a) Problem is degenerate                                    b) Problem is ‘unbalanced

c) It is a maximization problem                      d) Optimal solution is not possible

Ans:    b ) Problem is ‘unbalanced

 vii) the maximum time in which an activity will be completed assuming all possible delays and postponements is termed as __________..

a) Optimistic time                   b) Most likely time

c) Pessimistic time                  d) Expected time

Ans:  c) Pessimistic time

Viii) the various alternatives or courses of actions available to each player in a game are called as __________..

a) Saddle points                      b) Strategies

c) Pay off                                d) 'n' player game

Ans:  b) Strategies

Ix) in simplex, a maximization problem is optimal when all delta j, i.e., cj-zj values are.

a) Either zero or positive                       b) Either zero or negative

c) Only positive                                  d) Only negative

Ans:     b) Either zero or negative

X) which of the following considers difference between two least costs for each row and column while finding initial basic feasible solution in transportation.

a) North west corner rule                    b) Least cost method

c) Vogel's Approximation method       d) Row minima method

Ans:    b) Least cost method

Q1.B) True or false (Attempt Any 7)                                               (7)

i) Probability of a project completing in its expected time (Te) will be always 100%

Ii) lf saddle point is available in a game, it is called as pure strategy game., iii) slack represents unutilized resources., iv) if in a transportation problem, number of rows is not equal to number of columns, then the problem is unbalanced., v) lf we introduce an unnecessary dummy activity, the error is termed as redundancy., vi) job sequencing problems are solved to ensure that, both, the total time to complete all jobs and idle time of each machine are maximum., vii) when more than one optimal solution is possible in a linear programming problem, it is termed as 'unique solution'., viii) regret matrix is made to convert a maximization problem into minimization problem in assignment., ix) critical path method (cpm) considers the three-time estimates: most likely, optimistic and pessimistic time estimates., x) in solving a job sequencing problem, it is assumed that all jobs require the same sequence of operations., q.2 a) a company produces 2 products a and b: x 1 and x 2 , are the quantities manufactured of products a and b respectively. the following objective function along with constraints is given to you: .

Max Z = 8x 1 + 16x 2 ,

Subject to constraints:

x 1 + x 2 < 200

x 2 < 125

x 1 + 2x 2 < 300

x 1 , x 2 > 0

Find how many units of Product A and Product B should be produced by the company so that the profit is maximized. Ls it a case of multiple optimal solutions? Use graphical method to solve the LPP.

Video solution.

x 1 + x 2 < 200   ---- (i)

x 2 < 125           ---- (ii)

x 1 + 2x 2 < 300 ---- (iii)

x 1 , x 2 > 0  

x 1 + x 2 = 200

Let X 1 = 0

0 + x 2 = 200

Therefore x 2 = 200                  (x 1 , x 2 ) = (0, 200)

Let X 2 = 0

 x 1 + 0 = 200

Therefore x 1 = 200                      (x 1 , x 2 ) = (200, 0)

  x 2 < 125    ---- (ii)

Let x 2 = 0

x 2 = 125                 (x 1 , x 2 ) = (0, 125)

x 1 + 2x 2 < 300     ---- (iii)

x 1 + 2x 2 = 300

Let x 1 = 0

 0 + 2x 2 = 300

            x 2 = 300 / 2                             Therefore x 2 = 150             (x 1 , x 2 ) = (0, 150)

x 1 + 2x 2 = 300 Let x 2 = 0 x 1 + 2(0) = 300 x 1 = 300                     (x 1 , x 2 ) = (300, 0)

Corner Point Method:

Optimal Profit Maximization is Rs. 2,400

Q2.b) you are given the per unit cost of transporting goods from 3 factories to 4 customers. the 3 factories a b and c have capacity to supply 500,300 and 200 units respectively. the 4 customers p, q, r and s require 180,150,350 and 320 units respectively., i) you are required to find the initial basic feasible solution using vogel's approximation method                                                                                                                 (5) ii) find the total cost of transportation schedule obtained using vam          (2).

Total Demand = 1000

Total Supply = 1000

Total Demand = Total Supply

Cost data is given

Minimization Problem

RIM Condition:

M + N – 1 = No. of Allocation

3 + 4 – 1 = 6

Therefore, RIM Condition is satisfied.

Optimal Solution is Non-Degeneracy

(ii) Total Cost of Transportation :

            = (150 x 10) + (230 x 12) + (120 x 13) + (180 x 7) + (120 x 8) + (200 x 7)

            = Rs. 9, 440

Q.2 C) You are given the following details for a project consisting of 8 activities:

(i) Draw the network diagram and identify the critical path.                    (3) (ii) Find earliest start time, earliest finish time, latest start time and latest finish time for each activity.                                                                                                      (4) (iii) Find free float for activity B.                                                              (1)

  Solution:    [Video Explanation ]

(i)                  Network Diagram

Paths in Network:

(1) A-E-F = 4 + 20 + 10 = 34 days

(2) A-D-G = 4 + 5 + 6 = 15 days

(3) B-G = 6 + 6 = 12 days

(4) C- H = 13 + 16 = 29

Projection Completion Time : 34 days

(ii)               Free Float for Activity B:

= Ej – Ei – t

= 9 – 0 – 6

= 15  

Q.2 D) There are 6 jobs to be performed in a factory and each would go through 2 machines A and B in the order AB. The processing time (in hours) is given for each job in each machine.

(i) determine the sequence of performing the jobs that would minimize the total time of completing all the jobs:                                                                                 (2) (ii) find the elapsed time.                                                                               (3) (iii) find idle time for both the machines.                                                    (2).

Solution :    [Video Explanation ]

(i)                  Optimal Sequence

A                                                                                                                           B

(ii)                 Elapsed Time Calculation :

  Total Min. Elapsed Time = 36 Hrs.

(iii)            Idle time for Machinery A    = 36 – 35 = 1 Hrs

Idle time for Machinery A    = 36 – 28 = 8 Hrs

Q.3. B) You are given the following details for a project with 8 activities.

(i) Draw the network diagram.                                                                                     (3)

(ii) Find the expected time of project completion along with standard deviation.       (2)

(iii) What is the probability of the project completing in 55 days?                               (2)

Ans:    [Video Explanation]

Network Diagram:

Paths in the Network:

1)       1-2-3-5-7-8  = 47 days

2)       1-2-4-6-7-8 = 33 days

Expected Project Completion Time : 47 days

Variance of critical path = 16/36 + 100/36 + 256/36 + 64/36 + 4/36 = 440/36 =12.22

SD of critical path = √variance

SD = √ 12.22   = 3.495                        = 3.5 days

Time = 55 days = te

Z = t – CP / SD

= 55 – 47 / 3.5 = 2.29 

Table value = 0.4890

P(55 days) = 0.5 + 0.4890      = 0.9890                      = 98.90% 

Q.3. C) You are given information about the cost (in Rs. Thousands) of performing different jobs by different persons. PI cannot perform J3. P3 cannot perform J4

(i)Obtain optimal assignmnt and find cost of such assignment.

(i)Is it a case of alternative optimal solution?

Ans:      [Video Explanation]

Prohibited Assignment = X (infinity)

The problem is unbalanced.

Taking P5 as Dummy

Cost is given.

Hence Minimization Problem.

Row Minimization

Column Minimization Not Required.

Min. No. of Lines = 4

Size of Matrix = 5 x 5

Therefore Not optimal

Change = Min. open Value = 4

Optimal Cost = 66,000

Q3.D) Two firms, Lacko textiles and Rayon textiles have 3 strategies each to select from. The 3 strategies are no advertisement, using moderate advertising and using heavy advertising. You are given the pay off matrix from view point of Lacko textiles, showing its market share under several combinations of strategies:

(    (i) Find the saddle point and value of game.      (ii) Comment on the strategy to be selected by both the companies.

Value of the Game = 50 x 10000 =     5,00,000

Q. 4 a) you are given a solution for a transportation cost problem. figures in each cell represent per unit transportation cost. figures in circle within each cell represent number of units allocated for transportation. x, y and z. are the 3 factories and a, b, c and d are the 4 customers..

(i) You are required to check the above solution for optimality.

(ii) If it is not optimal, use modified distribution method to obtain optimal solution.

(iii) Find optimal transportation cost.

Ans:  [Video Explanation]

No negative ∆, Hence Optimal Solution.

(iii) Optimal transportation Cost:

= (200 x 7) + (120 x 18) + (100 x 15) + (280 x 7) + (180 x 11) + (12 x 5)

= RS. 9,600

B) You are given the following information, for a project with 8 activities:

The cost of completing the eight activities in normal time is Rs.6,500.

Indirect cost is Rs 160 per day. The contract includes a penalty of Rs. 100 per day for every day of delay more than 17 days.

  (i)   Draw the network diagram and find critical path.

(i     (ii)  Crash the projèct duration to find the total 'cost of completing the project in 17 days (4)

  Ans:  [Video Explanation]

Q.4. C) A company produces 2 products x and xX) using three resources S1, S2 and S. Product x1 gives profit of Rs.30 per unit and product x2 gives profít of Rs.40 per unit. The 3 resources Si. S and S; are available to the extent of 200 units, 600 units and 500 units respectiveiy The following objective function and constraints are given to you:

Max Z = 30x1 + 40x2

Subject to constraints;

x 1 + 2x 2 < 200

8x 1 + 5x 2 < 600

3x 1 + 4x 2 < 500

X1 >0; x2 >0

You are given the following simplex solution to the above problem:

  A) With reference to the above table answer the following:

i) Check if the above solution is optimal or not.

ii) lf it is not optimal, find optimal solution.

B) With reference to the optimal simplex table in the above problem obtained by you, answer the following:

iii) Find the optimal product mix and optimal profit

iv) Which resources are scarce and which are, unutilized?

v) Is it a case of alternative solution? Justify your answer

vi) What are the shadow prices of the resources? Justify

Ans:       [Video Explanation]

Testing the given solution for optimality ;

Positive ∆

Hence, solution not optimal.

(ii) Revising the Solution for Optimality:

No positive ∆

Therefore, Optimal Solution

(iii) Optimal Product Mix;

No. of units of X1 = 200/11        = 18.18

No. of units of X1 = 1000/11      = 90.90

Optimal Profit:

Max Z = [30 x 200/11] + [40 x 1000/11]

          = Rs. 46,000 /11

          = Rs. 4,181.81

(iv) Abundant Resource:

S3 = 900/11 ----- in optimal solution

Therefore Unutilized Capacity of S3 = 900 / 11

S3 is Abundant resource.

S1 and S2 are non-basis variable in optimal solution.

 Unutilized Capacity of S1 and S2 are 0

(i)                 ∆ of non basis variable :

∆ of S1 = - 170 / 11

∆ of S2 = -20/11

No zero ∆ value.

Hence, this is a case of Unique Solution.

There is no alternate optimal solution.

(ii)              Zj value of slack variables:

Q.5 A) Explain the concepts : Total float, free float, Independent float and Interfering float.           (8) 

(a) Total float:

lt is the amount of time by which the completion of an activity can be delayed beyond the earliest possible finishing time without affecting total project completion time.

 Total Float = (LST - EST) or (LFT - EFT)

.:: Total float = LST - EST -[;-t]-E Total Float = [Lj- E -t

(b) Free float:  It is the amount of time by which the completion of an activity can be delayed beyond the earliest finishing time without affecting the earliest possible start of a subsequent activity.

Free float = Earliest starting time of subsequent activity - Earliest finishing time of activity ij = Ej- [E, + t;] . Free Float = Ej- E-tj

(c) Independent float:  It is the amount of time by which the start of an activity can be delayed without affecting the earliest start of a subsequent activity, assuming that the preceding activity has finished at its latest finishing time. .

:. Independent float = Earliest starting time of subsequent activity - Latest finishing time of preceding activity - ij

:. Independent Float = [Ej-Li]-tij;

(d) Interfering float:  It is that part of total float which reduces the float of a subsequent activity. It is the amount of time by which the earliest possible start of a subsequent activity will be delayed if activity ÷ finishes on latest finishing time.

:. Interfering float = Latest finishing time of activity ij - Earliest starting time of subsequent activity. :. Interfering Float= Lj-Ej

B) Discuss any 5 areas where techniques of operation Research can be applied.    (7) 

OR techniques are applied to a variety of business problems. Some examples are:

(A) Production management:

(1) To calculate loss of time due to waiting time, queuing time etc.

(2) To decide optimum allocation of jobs and optimum sequence in which jobs should be sequenced.

(B) Personnel management:

(1) To study labour turnover. (2) To do human resource planning. (3) To decide number of personnel required to be kept on standby in case of demand for higher manpower.

(C) Inventory management: (1) To study economic lot size to be ordered.

(D) Marketing management: (1) To decide optimal product mix for maximum profit. (2) Media selection for advertising for maximum reach. (3) Sales forecasting.

(E) Transportation management: (1) To determine transportation schedule for minimum cost or minimum time.

(F) Project management (1) To identify critical and non-critical activities of a project (2) To determine minimum project completion time. (3) To determine optimal project cost.

(G) Financial management: project. (1) To decide investment portfolio to maximize return on investment. of such nature that it is impossible to find a feasible solution that can satis1y a the constraints. Following sketch explains infeasibility:

c) Answer any 3 of the following :            (15) 

I) explain the terms: redundant constraints and infeasible solution in linear programming. , a redundant constraint is the one which does not affect the optimal solution. even if that constraint is not considered, we can still obtain the solution to the problem. since the constraint is not required for obtaining the optimal solution, it is called redundant constraint cost..

Following sketch explains redundancy (redundant constraint):

There is no common feasible region for line AB and line CD

Hence, solution is infeasible.

A redundarnt constraint is the one which does not affect the optimal solution. Even if that constraint is not considered, we can still obtain the solution to the problem. Since the constraint is not required for obtaining the optimal solution, it is called redundant constraint. cost.

The feasible region for the above problem is OABC. The 3rd constraint does not affect the feasible region. Hence, the constraint [X1 S 16] is redundant constraint.

ii) what do you means by alternative optimal solution in transportation? How do you find that alternative solution? 

Alternate optimal solution or multiple optimal solutions mean there are two sets of solutions which provide the same optimal cost or optimal profit:

(a) In the optimal solution to a transportation problem, if there is an empty cell with zero A value, it means there is alternate optimal solution.

(b) To find alternate optimal solution, we should construct a closed loop from the empty cell with zero A. The new table we obtain after looping is the alternate optimal solution.

iii) Explain the time coat trade off in project crashing. 

The execution of a project involves two types of costs, direct cost and indirect cost.

(a) Direct costs: These include costs of materials, machinery, tools, manhours etc. When we estimate the duration of various activities in the project, it is assumed that normal amount of labour (manhours) & machines will be required to complete these activities. The estimation of direct costs is done based on the normal amount of resource required. This estimation gives us minimum possible direct cost required to complete the project. When we want to complete the project in a shorter period than critical path, we will need to employ more resources. Hence, direct cost will increase.

(b) Indirect costs: These include rent, overheads, administrative costs etc. Indirect costs vary with time. They are expressed on per day (or per week etc.) basis. Hence, when we shorten the project completion time, total indirect cost reduces.

Total P'roject Cost = Direct Cost + Indirect Cost

iV) Discuss the signification of theory of game. Briefly discuss the terms. Player and pay off.

Ans: Every one business party. The situation (also called competitive situation) involves more parties involved could be corporate. individuals, small firms or A number of outcome alternatives are available to each party for decision making. The (i.e. profit or loss) of the business decision does not depend on the alternative selected by one party alone, but on the interaction between the decisions of all the parties involved in the situation. Each party will try to select the alternative which maximizes gains for it, at the cost of its competitors. "Games Theory" deals with such business situations or problems where multiple parties are involved in the conflict through interaction of their alternatives or decisions.

Players: The various participants or decision markers in the game are called "Players". A game must have minimum two players (or competitors). A game having two competitors opposing each other is called 'two person game' and a game having more than 2 players is called 'n-person game'.

Payoff: Payoff is the outcome of the interaction of selected strategies of opponents in the game. Positive payoff is gain and negative payoff is loss. In a 'two person game', when one party gains, the other party loses.

v) Distinguished between PERT and CPM. 

Click here to download the question paper : q.p. 2019.

Post a Comment

• 11th commerce maths & Stats
• 11th English Solution
• 11th FYJC Admission Regular Round & CutOff
• 11th FYJC OCM Syllabus and Solutions
• 12th English Solution
• 12th Science Physics
• B.Ed Question Papers
• Direct Taxes
• Film Review
• FYBCOM Maths-Stats Sem-2
• FYBCOM Questions Paper
• FYJC 11th Bk & Account
• FYJC 11th Economics
• HSC 12th Hindi रसास्वादन
• HSC Bk & Account
• HSC BOARD EXAM PAPER & SOLUTION
• Hsc Economics & Solutions
• HSC Maths & Stats
• Hsc organisation of Commerce and management Syllabus with solution
• HSC Practice Test Paper
• HSC Secretarial Practice SP & Solution
• HSC SSC Board Exam
• Indirect Tax- GST
• Logarithm Properties
• Logistics and SCM
• MCom Financial Management
• Mumbai University Exam TIME TABLE
• Pre enrollment Admission in Mumbai University
• S.Y.B.Com (IDOL) Exam PAPER
• SSC and HSC Board Exam Time Table
• SSC BOARD EXAM PAPER & SOLUTION
• Strategic Marketing Management
• SYBCOM Economy
• SYBMS Question Papers
• TYBCOM Cost Account
• TYBCOM Financial Accounting
• TYBMS Human Resource
• TYBMS Logistics & Supply Chain Management
• TYBMS MCQ with SOLUTION
• TYBMS Operation Research QP with Answer
• TYBMS SEM 6 Marketing: International Marketing
• TYBMS Semester 5 Sales & Distribution Management.
• TYBMS Semester 5
• TYBMS Semester 6 Brand Management
• TYBMS Semester 6 Marketing

Popular Posts

TYBMS Semester 6 Operation Research Q.P. April 2023 with Solution

TYBMS Semester 6 Operation Research Q.P. November 2019 with Solution

• HSC BOARD EXAM PAPER & SOLUTION 16
• SSC BOARD EXAM PAPER & SOLUTION 8

Most Recent

Random posts, most popular, menu footer widget.

• Copyright © 2022-23MukundEducare.blogspot.Com - All Rights Reserved.

DAVV Question Paper

Download bba 4 sem operations research n821 jul 2019.

KTU Operations Research (Elective) Question Papers

by ktunotes.net

Select your KTU B.Tech Operations Research (Elective) Notes from the following list of modules.

• Free Audios/Videos on this module
• KTU Operations Research - S6 University Question Paper April 2018
• KTU Operations Research University Exam Question Paper May 2019
• Notes on Operations Research (Elective)

OnCampus Placements

Ktu notifications, recommended.

Operations Research Proceedings 2019

Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Dresden, Germany, September 4-6, 2019

• Conference proceedings
• © 2020
• Janis S. Neufeld 0 ,
• Udo Buscher 1 ,
• Rainer Lasch 2 ,
• Dominik Möst 3 ,
• Jörn Schönberger 4

Faculty of Business and Economics, TU Dresden, Dresden, Germany

You can also search for this editor in PubMed   Google Scholar

Faculty of Transportation and Traffic, TU Dresden, Dresden, Germany

• Presents latest findings from operations research (OR)
• Gathers selected papers from a leading OR conference
• Summarizes the perspectives of OR researchers on recent and upcoming challenges

Part of the book series: Operations Research Proceedings (ORP)

144k Accesses

73 Citations

4 Altmetric

This is a preview of subscription content, log in via an institution to check access.

Access this book

• Available as EPUB and PDF
• Read on any device
• Instant download
• Own it forever
• Compact, lightweight edition
• Dispatched in 3 to 5 business days
• Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (99 papers)

Front matter, analysis and optimization of urban energy systems.

• Kai Mainzer

Optimization in Outbound Logistics—An Overview

• Stefan Schwerdfeger

Incorporating Differential Equations into Mixed-Integer Programming for Gas Transport Optimization

• Mathias Sirvent

Scheduling a Proportionate Flow Shop of Batching Machines

• Christoph Hertrich

Vehicle Scheduling and Location Planning of the Charging Infrastructure for Electric Buses Under the Consideration of Partial Charging of Vehicle Batteries

• Luisa Karzel

Data-Driven Integrated Production and Maintenance Optimization

• Anita Regler

Business Analytics, Artificial Intelligence and Forecasting

Multivariate extrapolation: a tensor-based approach.

• Josef Schosser

Business Track

Heuristic search for a real-world 3d stock cutting problem.

• Katerina Klimova, Una Benlic

Control Theory and Continuous Optimization

Model-based optimal feedback control for microgrids with multi-level iterations.

• Robert Scholz, Armin Nurkanovic, Amer Mesanovic, Jürgen Gutekunst, Andreas Potschka, Hans Georg Bock et al.

Mixed-Integer Nonlinear PDE-Constrained Optimization for Multi-Modal Chromatography

• Dominik H. Cebulla, Christian Kirches, Andreas Potschka

Sparse Switching Times Optimization and a Sweeping Hessian Proximal Method

• Alberto De Marchi, Matthias Gerdts

Toward Global Search for Local Optima

• Jens Deussen, Jonathan Hüser, Uwe Naumann

First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method

• Ambros Gleixner, Nils-Christian Kempke, Thorsten Koch, Daniel Rehfeldt, Svenja Uslu

A Steepest Feasible Direction Extension of the Simplex Method

• Biressaw C. Wolde, Torbjörn Larsson

Convex Quadratic Mixed-Integer Problems with Quadratic Constraints

• Simone Göttlich, Kathinka Hameister, Michael Herty
• business analytics
• decision analytics
• digital economy
• mathematical optimization
• multicriteria decision making
• optimization and simulation
• logistics scheduling
• transportation
• OR applications in production
• OR applications in supply chains
• OR applications using big data

About this book

Editors and affiliations.

Janis S. Neufeld, Udo Buscher, Rainer Lasch, Dominik Möst

Jörn Schönberger

About the editors

Bibliographic information.

Book Title : Operations Research Proceedings 2019

Book Subtitle : Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Dresden, Germany, September 4-6, 2019

Editors : Janis S. Neufeld, Udo Buscher, Rainer Lasch, Dominik Möst, Jörn Schönberger

Series Title : Operations Research Proceedings

DOI : https://doi.org/10.1007/978-3-030-48439-2

Publisher : Springer Cham

eBook Packages : Business and Management , Business and Management (R0)

Copyright Information : The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020

Softcover ISBN : 978-3-030-48438-5 Published: 25 September 2020

eBook ISBN : 978-3-030-48439-2 Published: 24 September 2020

Series ISSN : 0721-5924

Series E-ISSN : 2197-9294

Edition Number : 1

Number of Pages : XV, 819

Number of Illustrations : 118 b/w illustrations, 30 illustrations in colour

Topics : Operations Research/Decision Theory , Operations Research, Management Science , Optimization , Operations Management

• Publish with us

Policies and ethics

• Find a journal
• Track your research

JavaScript seems to be disabled in your browser. For the best experience on our site, be sure to turn on Javascript in your browser.

Operations Research–T.Y.B.M.S.–Semester–VI (Vikram Shrotri)

1. Introduction to Operations Research

2. Linear Programming Problems : Introduction and Formulation

3. Linear Programming Problems : Graphical Method

4. Linear Programming Problems : Simplex Method

5. Assignment Problem – Hungarian Method

6. Transportation Problems

7. Network Analysis

8. Job Sequencing Problems

9. Theory of Games

Mumbai University Question Paper (April 2018)

Mumbai University Question Paper (October 2018)

Mumbai University Question Paper (May 2019)

A2Z Papers No.1 Website Providing old Question Papers

Gndu , b.com. , sem–vi ., operations research., question paper 2019 download ., question paper 2021 download ., question paper 2022 download ., sidebar menu, terms and conditions, follows on...

We providing GNDU question papers, PTU question papers, PU question papers, LPU question papers, GNA University question papers, PSEB question papers, HPSEB question papers, ICSE question papers and CBSE question papers. What sets the team A2ZPAPER.COM apart from others is that it provides the stream, subjects and semester wise classification of question papers for ease of use and access. This can prove to be an ultimate and handy resource for effective preparation of university and state examination board.....

By using the information available through this site and downloading any question paper, you are agreeing to the terms and conditions contained herein. This site is not associated with the question papers it provides for download and cannot be held liable for issues or faults that arise from their download or use .

• Linking to our Website
• Use of Website
• Privacy Policy

Image Gallery

Contact info.

Phone: +91-110-2536804 Address: 14 Hind Rd, Near GNDU, Delhi E-mail: [email protected]

© Copyright 2016 Pc Solutions All rights reserved.

• February 2024
• January 2024
• December 2023
• November 2023
• October 2023
• September 2023
• August 2023
• February 2023
• January 2023
• December 2022
• January 2022
• November 2021
• August 2021
• February 2021
• November 2019
• Academic Performance
• AU Syllabus
• Duplicate Certificate
• Internal Marks
• Malpractice
• Notes & QP
• Recent Notifications
• Transcripts
• WH (With-Held)
• Entries feed
• Comments feed
• WordPress.org

Operations Research (ME6015) Notes, Question Papers & Syllabus

APR/MAY 2023 EXAMS

Engineering Graphics (GE3251) [EG] Notes, Question Papers & Syllabus

Basic electrical, electronics and instrumentation engineering (be3252) [beeie] notes, question papers & syllabus, electric circuit analysis (ee3251) [eca] notes, question papers & syllabus.

Stay Connected with STUCOR App