Linear Prog COP4355_Part_37

# Linear Prog COP4355_Part_37 - Chapter 14 Dynamic...

This preview shows pages 1–3. Sign up to view the full content.

152 Chapter 14 Dynamic Programming 14.5 (continued) Stage 2 ____________________________________________________________ Inventory Sales in Profit Profit Total Profit Available(X T ) Stage 2(S T ) (TP T ) X N (TP N ) (TP T )+(TP N ) (000's) (000's) (000's) ____________________________________________________________ 2 0 -22 6 6 -16 2 1 -2 5 5 3 2 2 10 4 4 14 2 3 20 3 3 23 2 4 26 2 2 28 2 5 28 1 1 29* 2 6 26 0 0 26 ____________________________________________________________ The strategy which maximizes the two month total profit is to sell 5 pools this month, priced at \$10,000 each, carry one over into next month, and produce 7 next month. Maximum total profit is \$29,000. 14.6 Atlanta Houston Dallas X TR 0 0 11 3 21 8 31 5 44 5 -15 X TR 0 0 2 8 8 41 2 50 X TR 00 1 9 4 5 2 55 X 3 = 5 X 2 X 1 X 0 S 3 S 2 S 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Solutions Manual and Workbook 153 14.6 (continued) STAGE 1 (Atlanta) _________________________________________________________ Autos Available Autos Actually to Sell (X 1 ) Sold (S 1 ) TR 1 * X 0 * _________________________________________________________ 0 0 0 0 1 1 9 0 2 2 14 0 3 3 15 0 4 4 12 0 5 5 5 0 _________________________________________________________ STAGE 2 (Houston) _____________________________________________________________ Autos Available Autos Total Revenue to Sell (X 2 ) Sold (S 2 ) TR 2 * X 1 * TR 1 * TR 1-2 * ____________________________________________________________ 0 0 0 0 0 0 ------------------------------------------------------------- 1 0 0 1 9 9 1 12 0 0 12 * ------------------------------------------------------------- 2 0 0 2 14 14 1 12 1 9 21 * 2 18 0 0 18 ------------------------------------------------------------- 3 0 0 3 15 15 1 12 2 14 26 2 18 1 9 27 * 3 18 0 0 18 ------------------------------------------------------------ 4 0 0 4 12 12 1 12 3 15 27 2 18 2 14 32 * 3 18 1 9 27 4 12 0 0 12 ----------------------------------------------------------- 5 0 0 5 5 5 1 12 4 12 24 2 18 3
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/13/2011 for the course COP 4355 taught by Professor Koslov during the Spring '10 term at University of Florida.

### Page1 / 4

Linear Prog COP4355_Part_37 - Chapter 14 Dynamic...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online