Name: M.

AFTAN AHMED CH-14082

EXAMPLE 16.1 REFINERY PLANNING AND SCHEDULING

Consider a very simple version of a refinery blending and production problem,

which is often formulated and solved in an algebraic modeling language such as
GAMS (see Chapters 7 and 9). Figure E16.1 is a schematic of feed stocks and
products for the refinery. Table E16.1 lists the information pertaining to the
expected yields of the four types of crudes when processed by the refinery. Note
that the product distribution from the refinery is quite different for the four
crudes. The entire multiunit refinery is aggregated into two processes: a fuel chain
and a lube chain. Table E16.1 also lists the forecasted upper limits on the
established markets for the various products in terms of the allowed maximum
weekly production. The problem is to allocate optimally the crudes between the
two processes, subject to the supply and demand constraints, so that profits per
week are maximized. The objective function and all constraints are linear, yielding
a linear programming problem (LP).
SOLUTION:
kbbl/wk
kbbl/wk
kbbl/wk
kbbl/wk
k$/wk
kbbl/wk
kbbl/wk
kbbl/wk
kbbl/wk
kbbl/wk
EXAMPLE 11.4 BOILER/TURBO-GENERATOR SYSTEM OPTIMIZATION
SOLUTION: