A polyhedral study of production ramping
type: Item
instance of: scholarly article
title: A polyhedral study of production ramping
zbMATH Open document ID: 1346.90627
author: Pelin Damcı-Kurt
author: Simge Küçükyavuz
author: Deepak Rajan
author: Alper Atamtürk
published in: Mathematical Programming. Series A. Series B
publication date: 2016-08-25T00:00:00Z
full work available at URL: https://www.osti.gov/biblio/1455405
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6619162
zbMATH Keywords: ramping
zbMATH Keywords: unit commitment
zbMATH Keywords: co-generation
zbMATH Keywords: production smoothing
zbMATH Keywords: convex hull
zbMATH Keywords: polytope
zbMATH Keywords: valid inequalities
zbMATH Keywords: facets
zbMATH Keywords: computation
MaRDI profile type: Publication
OpenAlex ID: W600957409
cites work: Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
cites work: A strong conic quadratic reformulation for machine-job assignment with controllable processing times
cites work: A cutting plane approach to capacitated lot-sizing with start-up costs
cites work: Lower bounds in lot-sizing models: A polyhedral study
cites work: Solving the unit commitment problem by a unit decommitment method
cites work: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
cites work: Min-up/min-down polytopes
cites work: Q4040221
cites work: Production Smoothing with Fluctuating Price
cites work: Q4735937
cites work: Q4840775
cites work: Production Planning by Mixed Integer Programming
cites work: Q4221106
DOI: 10.1007/S10107-015-0919-9
description: scientific article; zbMATH DE number 6619162