Codex Wiki
OurBigBook.com
Site
Source code
Reduced cost
...
Area of mathematics
Mathematical optimization
Linear programming
Linear programming duality
Transportation problem
Transportation simplex algorithm
OurBigBook.com
Words: 18
For transportation potentials, the reduced cost is
c
ˉ
ij
=
c
ij
−
u
i
−
v
j
; 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
(2)
Solution
Solution