Learn · Data Analysis & Decision Making - III
Lecture 31 of 63Week 7
Lecture 31: Transportation problem
Prof. Raghu Nandan Sengupta · IIT Kanpur
Credits and licence
- From
- Data Analysis & Decision Making - III, IIT Kanpur (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture 01: Introduction
- Lecture 02: Linear programming
- Lecture 03: Linear programming
- Lecture 04: Utility analysis
- Lecture 05: utility analysis
- Lecture 06: Utility theory
- Lecture 07: Utility theory
- Lecture 08: Utility Analysis
- Lecture 09: Safety first principle
- Lecture 10: Safety first principle (contd...)
- Lecture 11: optimization
- Lecture 12: optimization
- Lecture 13: optimization
- Lecture 14: optimization
- Lecture 15: simplex method
- Lecture 16: simplex method
- Lecture 17: simplex method
- Lecture 18: simplex method
- Lecture 19: optimization
- Lecture 20: simplex method
- Lecture 21: simplex method
- Lecture 22: simplex method
- Lecture 23: simplex method
- Lecture 24: Optimization
- Lecture 25: Optimization
- Lecture 26: Optimization
- Lecture 27: simplex method
- Lecture 28: simplex method
- Lecture 29: simplex method
- Lecture 30:Transportation problem
- Lecture 31: Transportation problem
- Lecture 32: Transportation problem
- Lecture 33: Transportation problem
- Lecture 34:Transportation problem
- Lecture 35: Loss function
- Lecture 36: DEA
- Lecture 37: DEA
- Lecture 38: DEA
- Lecture 39: Gomory cutting plane algorithm
- Lecture 40: Gomory cutting plane algorithm
- Lecture 41: integer programming
- Lecture 42: integer programming
- Lecture 43: integer programming
- Lecture 44: quadratic programming
- Lecture 45: portfolio optimization
- Lecture 46: chance constraint problem
- Lecture 47: branch and bound
- Lecture 48: branch and bound
- Lecture 49: branch and bound
- Lecture 50: branch and bound
- Lecture 51: quadratic programming
- Lecture 52: steepest descent
- Lecture 53: reliability based optimization
- Lecture 54: reliability based optimization
- Lecture 55: reliability based optimization
- Lecture 56: Sequential Optimization and Reliability Assessment
- Lecture 57: Reliability/Stochastic Optimization
- Lecture 58: Reliability/Stochastic Optimization
- Lecture 59: Robustness
- Lecture 60: Robustness
- Live Session 13-08-2024
- Live Session 13-08-2024
- Live Session 13-08-2024