A dynamic programming extension to the steady state refinery-LP

F. Höfferl and D. Steinschorn

European Journal of Operational Research, 2009, vol. 197, issue 2, 465-474

Abstract: Standard LPs, widely used for planning in the processing industry, are powerful tools for making economic decisions, but do not cover time relationships inside the planning timeframe. To include sequence-dependent issues within the optimization process, an algorithmic extension to the LP was developed. DPX (Dynamic Programming Extension) is used to solve a whole class of problems that are dynamic in time.

Keywords: Linear; programming; Dynamic; programming; Sequencing; Scheduling (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00517-1
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:197:y:2009:i:2:p:465-474

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().