|
| Course Content |
Time Allocated |
| L |
T |
P |
A |
Computational Difficulties
- Efficiency of algorithms, Average and worst case analysis
|
2 |
|
|
|
Interior Point Algorithms
- Karmarkar’s projective algorithm, Affine scaling algorithms
|
4 |
1 |
|
|
Heuristic Programming
- Need for heuristics, Types of heuristics, Greedy algorithms, Genitic algorithms, Simulated annealing, Neural networks
|
8 |
2 |
|
|
Multiple Criteria Optimization
- Goal programming, Weighting method, Preemptive method
|
4 |
1 |
|
|
Integer Programming
- Branch and bound algorithms, Cutting plane algorithms, Implicit enumeration technique
|
6 |
2 |
|
|
Total = 24 + 6 = 30
|
24 |
6 |
|
|
| |
| Assessment |
Percentage Mark |
| Continuous Assessment |
|
40 |
| Assignment |
40 |
|
| Course work |
|
|
| Written Examinations |
|
60 |
| Mid-Semester |
|
|
| End of Semester |
60 |
|
|
Notation Used :
L - Lectures
T - Tutorials
P - Practical works
A - Assignments
|