At the end of this course, students should be able to:
Formulate Linear, Integer and Mixed Integer Programming problems and use methods such as Simplex and branch and bound for their solution.
Use decision tables/ trees, and basic queueing models to make decisions under uncertainty, and risk.
Formulate Dynamic Programming models for standard problems (Knapsack, Shortest path search) and solve them using the tableau method.
Formulate multi criteria decision making problems using Data Envelopment Analysis; formulate and solve Analytic Hierarchy Problems (AHP) using matrix computations.
Identify different non-conventional, evolutionary and heuristic algorithms such as Genetic Algorithm, Simulated Annealing and Ant Colony Optimization.
Execute engineering projects as per project management lifecycle and use standard project management software for planning and management purposes.
|
Linear, Integer and Mixed Integer Programming Graphical solution method, Simplex method, Sensitivity analysis, Branch and Bound solution for Integer Programming problems
Dynamic Programming: Dynamic Programming in mathematical optimization (Knapsack and Shortest Path Search), Applications of Dynamic Programming
Decision Theory: Decision making under certainty, uncertainty, and risk
Introduction to Project Management: Projects and non-projects, project life cycle concept, project manager’s role, Nine knowledge areas of project management, Project planning and scheduling, Project selection Statement of Work (SOW), Work Breakdown-Structure (WBS) and Responsibility
matrix, Network analysis techniques: Critical Path Method (CPM), Project Evaluation and Review,
Technique (PERT), Gantt chart and resource mapping, Monitoring and controlling project cost,
quality, and time Investment appraisal of projects, Computer applications for project management
Queueing Theory and Modelling: Single and multiple servers, infinite and finite source models
Introduction to Multi Criteria Decision Making: Introduction to Analytic Hierarchy Process (AHP),
Data Envelopment Analysis (DEA)
Introduction to Non-Conventional Optimization Techniques: Evolutionary and heuristic algorithms
|