{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

HW Due 12-6-2010 - HW Due Problem 1 Notes problem statement...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

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

View Full Document Right Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: HW Due 12-6-2010 Problem 1: Notes problem statement: A company has known weekly orders for varying numbers of a given product over the next 5 weeks. These requirements are 50, 30, 60, 45, and 25. To make a production run for this product, it costs $25 to setup the machine and each unit produced costs an additional $100. The company has production capacity and storage space for as many units of the product as needed; however, it costs $1 per unit per week to store units needed in future time periods. The production capacity is such that all five future period demands could be produced in a single run. Of course, the company would incur a considerable holding cost. Thus, the problem is to determine in which periods to make production runs and how many items to produce on each run. This analysis is to be based on a minimum cost basis. Home-Work: Resolve this problem with the setup cost of s55 r‘ather than $25. (Answer, (80,0, 60,70, 0) foratotalcostof$21,220.) Problem 2: Min cost through a network—problem from Taha, 7-9. I] 7—9 (Shortest Reute Problem) The network given in Figure 7—7 gives different routes for reaching city B from city A passing through a number of other cities. The lengths of the individual routes are shown on the arrows. It is required to determine the shortest route from A to B. Formulate'the problem as a dynamic programming model. Explicitly define the stages, states, and return function; then find the optimal solution. FROM T’QH}? Figure 7—7 Problem 3: The demand for a product over the next four time periods is 2, 3. 4, and 2 units. The cost of placing an order is $15, independent of the number of units ordered. The individual item cost is $100, and the holding is $2 per unit per period. Due to the company accounting system, holding costs are charged on the inventory units at the beginning of a period; that is, on entering inventory. A maximum of four units can be held from period to period. The company orders from a local supplier, so we can consider that units ordered in a period are available for use in the same period. However. due to the limited production capacity of the supplier, orders are limited to once a period with a maximum of five units. We want the optimal ordering policy that meets the demands at minimal cost for the four time periods. The company currently has no items in inventory and has no :7; ‘1 0 requirements for a specified number in inventory at the end of the planning horizon. Since demands must be met, ordering for future demand is the only viable option for decreasing costs. Problem: Resolve this problem with a setup cost of $20 and an inventory holding cost of $3 per unit per period. ...
View Full Document

{[ snackBarMessage ]}