For transportation potentials, the reduced cost is cˉij=cij−ui−vj; a negative value identifies an improving entering cell.
Ancestors (8)
- Transportation simplex algorithm
- Transportation problem
- Linear programming duality
- Linear programming
- Mathematical optimization
- Area of mathematics
- Mathematics
- Home
Incoming links (23)
- Augmenting path in a matching
- Dantzig pivot rule
- Dual feasibility
- Greatest improvement pivot rule
- Hungarian algorithm
- Linear programming sensitivity within a fixed optimal basis
- Network simplex algorithm
- Past exam of the mathematics course of the University of Cambridge / 2001 / ib / Paper 3 / 15D / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / ib / Paper 4 / 14H / Solution
- Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 33 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 40 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 38 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 38 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2009 / ib / Paper 3 / 20H / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 35 / 3 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 212 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2022 / ib / Paper 3 / 19H / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2025 / ib / Paper 4 / 18H / c / Solution
- Past exam of the Probability, statistics and options II course of the University of Oxford / 2007 / T / 2 / c / iii / Solution
- Past exam of the Probability, statistics and options II course of the University of Oxford / 2007 / T / 2 / d / Solution
- Reconstructing a linear program from a final simplex tableau
- Simplex optimality criterion
- Transportation dual potentials
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.