Scribd
Upload
23 views1 page

Optimization Methods in A Few Selected Areas

The document provides details of the Optimization (ICT Elective) course including its code, intended students, structure, purpose, pre-requisites, contents and references. The main purpose is to provide working knowledge of optimization methods in selected areas. Contents include introduction to optimization methods, linear programming, transportation problem, game theory and queuing models. Evaluation will be based on two in-semester exams, final exam and attendance.

Uploaded by

Jahanvi Sapoliya
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
23 views1 page

Optimization Methods in A Few Selected Areas

The document provides details of the Optimization (ICT Elective) course including its code, intended students, structure, purpose, pre-requisites, contents and references. The main purpose is to provide working knowledge of optimization methods in selected areas. Contents include introduction to optimization methods, linear programming, transportation problem, game theory and queuing models. Evaluation will be based on two in-semester exams, final exam and attendance.

Uploaded by

Jahanvi Sapoliya
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/ 1

Title: Optimization (ICT Elective)

Course code: IE4XX


Students: BTech SemV & SemVII
Structure: 3-0-0-3
Purpose: The main purpose of this course is to provide the students working knowledge of
optimization methods in a few selected areas.
Pre-requisite: Calculus and Linear Algebra

Contents
1. Introduction to optimization methods (1 hr.)
2. Optimization (8 hr.s)
• Calculus based method
• Lagrange multiplier
• Kuhn-Tucker Condition
3. Linear programming problem (12 hr.s)
• Simplex method
• Revised simplex method
• Duality
• Dual simplex method
• Post optimality problems
• Sensitivity analysis
4. Transportation problem (4 hr.s)
• North-west corner Rule
• Row-minimum method
• Vogel’s Approximation
• u-v method
5. Introduction to Game Theory (Decision making under competition) (6 hr.s)
• Game with pure strategies
• Game with mixed strategies
• Dominance property
• Graphical method for 2 x n (or m x 2) Games
6. Introduction to Queuing Model (6 hr.s)
• Characteristics involved in queuing models
• Markovian models (variations of M|M|1 and M|M|c models)

References:
1. An introduction to optimization by E. K. P. Chong and S. H. Zak (Wiley)
2. Engineering optimization – Theory and practice by S. S. Rao (New Age international Pvt. Ltd.)
3. Operation research: An introduction by H. Taha (Prentice Hall, India)
4. Operation Research by R. Panneerselvam (Prentice Hall, India)
5. Linear Programming and Game Theory by D. Chatterjee (Prentice Hall, India)
6. Quantitative Techniques for Decision Making by Gupta and Khanna (Prentice Hall, India)
7. Optimization in operation research by Rardin (Pearson Education)

Evaluation
• 2 in-sem exam
• Final exam
• Attendance
I will add the marks of all three components.

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