Multiple Modular Design Over a Finite Time Horizon

DOI10.1080/02522667.1982.10698717zbMath0475.90040OpenAlexW2058172541MaRDI QIDQ3930999

Kurt J. Engemann

Publication date: 1982

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1982.10698717

zbMATH Keywords

product differentiationmodularitymodular designfinite time horizonstandardization of subassemblies

Mathematics Subject Classification ID

Production models (90B30)

Cites Work

• A Simplex-Like Algorithm for the Continuous Modular Design Problem
• Modular Design, Generalized Inverses, and Convex Programming
• A New Method of Constrained Optimization and a Comparison With Other Methods
• Technical Note—An Integer Approach to Modular Design
• Modular Design: An Application of Structured Geometric Programming
• A Simplex Method for Function Minimization
• Primal Decomposition of Mathematical Programs by Resource Allocation: I—Basic Theory and a Direction-Finding Procedure
• Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem
• Modular Design—A Special Case in Nonlinear Programming

This page was built for publication: Multiple Modular Design Over a Finite Time Horizon