Share
Notifications

View all notifications

Operation Research Semester 6 (TE Third Year) BE Computer Engineering University of Mumbai Topics and Syllabus

Login
Create free account


      Forgot password?
CBCGS [2018 - current]
CBGS [2014 - 2017]
Old [2000 - 2013]

Topics with syllabus and resources

100.00 What Is Operations Research
200.00 Modeling With Linear Programming
201.00 Two-variable LP Model
202.00 Graphical LP Solution
  • Solution of a Maximization Model
  • Solution of a Minimization Model
203.00 Computer Solution With Solver And AMPL
  • LP solution with Excel Solver
  • LP Solution with AMPL
204.00 Linear Programming Applications
  • Investment
  • Product Planning and Inventory Control
  • Manpower Planning
  • Urban Development Planning
  • Blending and Refining
  • Additional LP Applications
300.00 The Simplex Method And Sensitivity Analysis
301.00 LP Model In Equation Form
302.00 Transition From Graphical To Algebraic Solution
303.00 The Simplex Method
  • Iterative Nature of the Simplex Method
  • Computational details of the Simplex algorithm
  • Summary of the Simplex Method
304.00 Artificial Starting Solution
  • M-Method
  • Two-Phase Method
305.00 Special Cases In The Simplex Method
  • Degeneracy
  • Alternative Optima
  • Unbounded Solution
  • Infeasible Solution
306.00 Sensitivity Analysis
  • Graphical Sensitivity Analysis
  • Algebraic Sensitivity Analysis – Changes in the Right­hand side
  • Algebraic Sensitivity Analysis – Objective function
  • Sensitivity Analysis with Tora, Solver, and Ampl
307.00 Computational Issues In Linear Programming
400.00 Duality and Post-optimal Analysis
401.00 Definition Of The Dual Problem
402.00 Primal-dual Relationships
  • Review of Simplex Matrix Operations
  • Simplex Tableau Layout
  • Optimal Dual Solution
  • Simplex Tableau Computations
403.00 Economic Interpretation of Duality
  • Economic Interpretation of Dual Variables
  • Economic Interpretation of Dual Constraints
404.00 Additional Simplex Algorithms
  • Dual Simplex Algorithm
  • Generalized Simplex Algorithm
500.00 Transportation Model And Its Variants
501.00 Definition Of The Transportation Model
502.00 Nontraditional Transportation Models
503.00 The Transportation Algorithm
  • Determination of the Starting Solution
  • Iterative Computations of the Transportation Algorithm
  • Simplex Method Explanation of the Method of Multipliers
504.00 The Assignment Model
  • The Hungarian Method
  • Simplex Explanation of the Hungarian Method
600.00 Decision Analysis
601.00 Decision Making Under Certainty
  • Analytic Hierarchy Process (AHP)
602.00 Decision Making Under Risk
  • Decision Tree-Based Expected Value Criterion
  • Variants of the Expected Value Criterion
603.00 Decision Under Uncertainty
700.00 Stimulation Modeling
701.00 Monte Carlo Simulation
702.00 Types Of Simulation
703.00 Elements Of Discrete Event Simulation
  • Generic Definition of Events
  • Sampling from Probability Distributions
800.00 Nonlinear Programming Algorithms
801.00 Unconstrained Algorithms
  • Direct Search Method
  • Gradient Method
802.00 Constrained Algorithms
  • Separable Programming
  • Quadratic Programming
900.00 Introduction To Spreadsheet Model
S
View in app×