Unit I
Linear Programming: Introduction – Mathematical Formulations – Solutions – Graphical Method – Simplex Method – Artificial Variables- Big M – Two Phase Methods – Variants in Simplex Method – Duality Theory and Problems.
| Course Name | Operations Research and Optimization |
| Course Code | 26CSA662 |
| Program | M. C. A. |
| Credits | 4 |
| Campuses | Amritapuri, Mysuru |
Linear Programming: Introduction – Mathematical Formulations – Solutions – Graphical Method – Simplex Method – Artificial Variables- Big M – Two Phase Methods – Variants in Simplex Method – Duality Theory and Problems.
Transportation and its Variants: Definition – Transportation Algorithms and Solutions -Assignment Model – Hungarian Method, Simulation -Types of Simulations – Monte Carlo Simulation.
Game Theory: Competitive Games – Rectangular Game – Saddle point – Minmax (Maxmin)Method of Optimal Strategies – Value of the Game. Solution of Games with Saddle Points -Dominance Principle. Rectangular Games without Saddle Point – Mixed Strategy for 2 X 2Games.
Single Variable Non-Linear Unconstrained Optimization
One dimensional Optimization methods, Uni-modal function, Region elimination methods – interval halving, Fibonacci search, Golden section search, point estimation method – successive quadratic search, Gradient based
Methods-Newton’s method, secant method.
Problem of sequencing, n jobs through two machines – two jobs through m machines – n jobs through m machines.
Integer Programming Algorithms: Branch and Bound Algorithms and Cutting Plane Algorithm.
Course Description
The course is intended to impart knowledge in concepts and tools of Operations Research, to understand mathematical models used in Operations Research and to apply these techniques constructively to make effective business decisions.
Course Objectives
This course aims to introduce students to use quantitative methods and techniques for effective decisions–making; model formulation and applications that are used in solving business decision problems.
Course Outcomes
|
Cos |
Description |
|
CO1 |
Describe concepts of linear programming, duality and methods for solving a linear programming problem. |
|
CO2 |
Explain mathematical formulation of transportation and assignment problems and solution methods. |
|
CO3 |
Solve simple games using various techniques. |
|
CO4 |
Solve nonlinear unconstrained optimization problems. |
|
CO5 |
Describe problem of sequencing and integer programming problems. |
CO-PO Mapping
|
PO/PSO |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
|
CO |
||||||||
|
CO1 |
3 |
1 |
1 |
– |
– |
2 |
– |
– |
|
CO2 |
3 |
2 |
1 |
– |
– |
2 |
– |
– |
|
CO3 |
3 |
2 |
1 |
– |
– |
– |
– |
– |
|
CO4 |
3 |
2 |
1 |
– |
– |
– |
– |
– |
|
CO5 |
3 |
1 |
– |
– |
– |
3 |
– |
– |
DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.