A simulation study of some simplification strategies in the development of product-mix models

DOI10.1016/0377-2217(83)90154-6zbMath0496.90042OpenAlexW2073496526MaRDI QIDQ1170110

S. Singh

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90154-6

zbMATH Keywords

simulation studyjob-shopmanufacturing optionsdegree of accuracyLP-models for product-mix planningsimplification strategies

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Applications of mathematical programming (90C90) Linear programming (90C05) Production models (90B30)

Related Items (1)

Restricted vertex generation applied as a crashing procedure for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simultaneous statistical inference. 2nd ed
• Determining appropriate levels of data aggregation in a linear programming model
• Bounds on the Effect of Aggregating Variables in Linear Programs
• Bounds for Row-Aggregation in Linear Programming
• Bounds for aggregating nodes in network problems
• Technical Note—Improved Bounds for Aggregated Linear Programs
• A priori error bounds for procurement commodity aggregation in logistics planning models
• Programming with linear fractional functionals

This page was built for publication: A simulation study of some simplification strategies in the development of product-mix models