# Difference: CokeSupplyChain (15 vs. 16)

#### Revision 162008-04-23 - MichaelOSullivan

Line: 1 to 1

 META TOPICPARENT name="SubmitCaseStudy"
<-- Under Construction -->
Line: 93 to 93

 FORM FIELD Results FORM FIELD Conclusions Results The results... Conclusions In conclusion...
|*FORM FIELD ExtraForExperts*|ExtraForExperts|This problem is similar to the Cosmic Computers Problem, but the facility location is a little different. Rather than face a decision about whether to build a plant or not, we need to determine what type of plant to build. This gives rise to the following variable:

While solving the Coke Supply Chain Problem, the expression

will often be fractional. This means that the capacity of the plant
where is the capacity of a plant of size will be between the capacities of two different size plants, e.g., 280 kT/yr is between 225 kT/yr plant and a 300 kT/yr plant. We could use constraints to remove the fractionality, e.g.,

These branches will ensure plants have the right capacities, but will still not resolve fractionalities in the . However, if we want the capacity of plant to be 225, then we can remove all the that allow for the capacity to be larger than 225:

Conversely, if we want to branch up, i.e., the capacity is 300, then we can remove all the that allow the capacity to be smaller than 300:

Note For these branches to work properly, the possibility of building no plant must be modeled as building a plant with no capacity (i.e., = 0) for no cost. |

Changed:
<
<
1. Write AMPL model, data and script files (coke.mod, coke.dat and coke.run respectively) to solve the Coke Production Problem. Write a management summary for your solution.

2. Experts Only Solve the LP relaxation of the Coke Supply Chain Problem integer programme. Using the branches described in Extra for Experts, use AMPL to perform branching on at least 4 nodes and draw the resulting branch-and-bound tree.

Hint See Extra for Experts in the Cosmic ComputersProblem for an example of constraint branching.

What to hand in Your AMPL code for implementing the branches. Your drawing of your branch-and-bound tree.

|
>
>
1. Write AMPL model, data and script files (coke.mod, coke.dat and coke.run respectively) to solve the Coke Production Problem. Write a management summary for your solution.