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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 292; číslo 3; s. 953 - 966
Hlavní autori:	Gopalswamy, Karthick, Uzsoy, Reha
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.08.2021
Predmet:	Capacity pricing Congestion Conic programming Production planning Congestion Capacity pricing Production planning Conic programming
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!