No open-access location is known for this record yet.
No open-access location is known for this record yet.
We formulate and solve a single‐item joint pricing and master planning optimization problem with capacity and inventory constrains. The objective is to maximize profits over a discrete‐time multiperiod horizon. The solution process consists of two steps. First, we solve the single‐period problem exactly. Second, using the exact solution of the single‐period problem, we solve the multiperiod problem using a dynamic programming approach. The solution process and the importance of considering both capacity and inventory constraints are illustrated with numerical examples.
Loading…
Stored only when both papers are in the corpus — 48 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.