The continuous modular design problem with linear separable side constraints

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper describes a heuristic for designing a single module in the presence of linear side constraints and nonlinear requirements constraints. The objective is to minimize the total parts cost to satisfy demand for a set of end products. We model the problem as a nonconvex programming problem and show that the problem can be transformed into an equivalent convex problem. Due to the size of the potential applications we develop a heuristic procedure that is an extension of the Shaftel and Thompson algorithm. Closed form expressions are derived for determining feasible movement directions and step lengths. Computational results are promising since the CPU time required to run the heuristic is small and the solutions compared favorably with solutions generated by standard nonlinear programming software.

Original languageEnglish (US)
Pages (from-to)210-226
Number of pages17
JournalEuropean Journal of Operational Research
Volume54
Issue number2
DOIs
StatePublished - Sep 25 1991

Fingerprint

Modular Design
heuristics
Nonlinear programming
Heuristics
Program processors
programming
Nonconvex Programming
CPU Time
Nonlinear Programming
Computational Results
Costs
Closed-form
Minimise
Module
Software
Modular design
demand
Requirements
costs

Keywords

  • Design
  • manufacturing industries
  • nonlinear programming heuristics

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

The continuous modular design problem with linear separable side constraints. / Goldberg, Jeffrey B.

In: European Journal of Operational Research, Vol. 54, No. 2, 25.09.1991, p. 210-226.

Research output: Contribution to journalArticle

@article{a31d8fc17b654676873f4562bb982d60,
title = "The continuous modular design problem with linear separable side constraints",
abstract = "This paper describes a heuristic for designing a single module in the presence of linear side constraints and nonlinear requirements constraints. The objective is to minimize the total parts cost to satisfy demand for a set of end products. We model the problem as a nonconvex programming problem and show that the problem can be transformed into an equivalent convex problem. Due to the size of the potential applications we develop a heuristic procedure that is an extension of the Shaftel and Thompson algorithm. Closed form expressions are derived for determining feasible movement directions and step lengths. Computational results are promising since the CPU time required to run the heuristic is small and the solutions compared favorably with solutions generated by standard nonlinear programming software.",
keywords = "Design, manufacturing industries, nonlinear programming heuristics",
author = "Goldberg, {Jeffrey B}",
year = "1991",
month = "9",
day = "25",
doi = "10.1016/0377-2217(91)90299-B",
language = "English (US)",
volume = "54",
pages = "210--226",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - The continuous modular design problem with linear separable side constraints

AU - Goldberg, Jeffrey B

PY - 1991/9/25

Y1 - 1991/9/25

N2 - This paper describes a heuristic for designing a single module in the presence of linear side constraints and nonlinear requirements constraints. The objective is to minimize the total parts cost to satisfy demand for a set of end products. We model the problem as a nonconvex programming problem and show that the problem can be transformed into an equivalent convex problem. Due to the size of the potential applications we develop a heuristic procedure that is an extension of the Shaftel and Thompson algorithm. Closed form expressions are derived for determining feasible movement directions and step lengths. Computational results are promising since the CPU time required to run the heuristic is small and the solutions compared favorably with solutions generated by standard nonlinear programming software.

AB - This paper describes a heuristic for designing a single module in the presence of linear side constraints and nonlinear requirements constraints. The objective is to minimize the total parts cost to satisfy demand for a set of end products. We model the problem as a nonconvex programming problem and show that the problem can be transformed into an equivalent convex problem. Due to the size of the potential applications we develop a heuristic procedure that is an extension of the Shaftel and Thompson algorithm. Closed form expressions are derived for determining feasible movement directions and step lengths. Computational results are promising since the CPU time required to run the heuristic is small and the solutions compared favorably with solutions generated by standard nonlinear programming software.

KW - Design

KW - manufacturing industries

KW - nonlinear programming heuristics

UR - http://www.scopus.com/inward/record.url?scp=0026221936&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026221936&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(91)90299-B

DO - 10.1016/0377-2217(91)90299-B

M3 - Article

AN - SCOPUS:0026221936

VL - 54

SP - 210

EP - 226

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -