A penalization approach to linear programming duality with application to capacity constrained transport
classification
🧮 math.OC
math.AP
keywords
dualityapplicationapproachlinearpenalizationprogrammingtransportaffine
read the original abstract
A new approach to linear programming duality is proposed which relies on quadratic penalization, so that the relation between solutions to the penalized primal and dual problems becomes affine. This yields a new proof of Levin's duality theorem for capacity-constrained optimal transport as an infinite-dimensional application.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.