10.7. Inventory optimization

Let us go back to the inventory problem presented in Section 9.9.
The problem was that of a firm receiving an order for B units of product to be delivered by time T, seeking an optimal production schedule for filling the order at the specified delivery date at minimum cost.
The CoV problems was formalized as follows:
min J ( y ) = 0 T [ c 1 y ( t ) 2 + c 2 y ( t ) ] d t
image
s . t . y ( 0 ) = 0 and y ( T ) = B with y ( t ) 0
image
The firm's objective is ...

Get Elements of Numerical Mathematical Economics with Excel now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.