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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 292; H. 3; S. 953 - 966
Hauptverfasser:	Gopalswamy, Karthick, Uzsoy, Reha
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.08.2021
Schlagworte:	Capacity pricing Congestion Conic programming Production planning Congestion Capacity pricing Production planning Conic programming
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!