Production Optimization Decision Problem Based on Multi-Stage Linear Programming and Alternative Complementarities
Reasonable allocation and utilization of resources in modern industrial production is the key to improve production efficiency and reduce costs. As an effective mathematical optimization tool, multi-stage linear programming is widely used in production planning, inventory management, supply chain optimization and other fields. The article first establishes the objective function and considers the sales and planting costs. Then, the article proposes six constraints, including the cultivated area of arable land, the relationship between crop yield and sales, the minimum value of the cultivated area of a crop, the concentration of crop cultivation, the limitation of crop cultivation in the same plot, and the cultivation interval of legume crops. The article considers complementarity and competition of legume crops, substitution of cereal crops, competition of root crops, complementarity of vegetable crops and complementarity of mushroom crops by constructing a multi-stage planning model. By constructing the mutual exclusion and complementarity matrix, the planting decision is optimized and the production efficiency is improved. The model proposed in this paper can effectively solve the problem of resource allocation in agricultural production and provide scientific decision support for agricultural production by considering the substitutability and complementarity between crops.
Authors
- Bai-Song Xie (ORCID: https://orcid.org/0000-0003-0757-9134)
- Xinhao Wu (ORCID: https://orcid.org/0009-0004-1288-3696)
- Yi‐Hsuan Yang (ORCID: https://orcid.org/0000-0002-2724-6161)
- Hongyi Chen (ORCID: https://orcid.org/0000-0002-6232-5463)
Institutions
- Beijing University of Chemical Technology (CN)
Publication Details
- Published
- 2024-12-29
- DOI
- https://doi.org/10.1109/icirdc65564.2024.00053
- Primary Topic
- Advanced Manufacturing and Logistics Optimization
- Type
- article
- Field-Weighted Citation Impact
- 0.00