Conic programming models for production planning with clearing functions: Formulations and duality

•We address the problem of production planning for resources subject to congestion.•We show that several of the principal clearing function forms used in the literature are conic representable.•The conic programs yield excellent solutions in lower CPU times than the LP formulations. Concave clearing...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 292; no. 3; pp. 953 - 966
Main Authors:	Gopalswamy, Karthick, Uzsoy, Reha
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2021
Subjects:	Capacity pricing Congestion Conic programming Production planning Congestion Capacity pricing Production planning Conic programming
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!