Home › Categories › Science & Nature› Download

Download.pdf

8714.pdf

🔗 Source: optimization-online.org

📊 Size: 201 KB

📄 Pages: 6 pages

⬇️ Downloads: 39

Summary

Researchers show a family of lot-sizing problem instances requires an exponential number of nodes in the branch-and-bound tree to solve, even with general split disjunctions. The lot-sizing problem involves determining production volumes to meet demands while minimizing costs. A specific instance with n time periods is formulated as a mixed-integer linear program, and it's proven that any general branch-and-bound tree solving this instance has at least 2(n/2)−1 leaf nodes, indicating an exponential lower bound on the tree size.

Download File

Description

Researchers show a family of lot-sizing problem instances requires an exponential number of nodes in the branch-and-bound tree to solve, even with general...

Technical Information

File Format: PDF
File Size: 201 KB
Pages: 6
Language: EN
Total Downloads: 39
Last Updated: 4 hours ago

Document Overview

This PDF document about Download provides comprehensive information and guidance. Whether you're a beginner or advanced user, this resource offers valuable insights into Download.