Skip to main navigation Skip to search Skip to main content

Foraging-directed adaptive linear programming: An algorithm for solving nonlinear mixed discrete/continuous design problems

  • Georgia Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

22 Scopus citations

Abstract

Design models often contain a combination of discrete, integer, and continuous variables. Previously, the Adaptive Linear Programming (ALP) Algorithm, which is based on sequential linearization, has been used to solve design models composed of continuous and Boolean variables. In this paper, we extend the ALP Algorithm using a discrete heuristic based on the analogy of an animal foraging for food. This algorithm for mixed discrete/continuous design problems integrates ALP and the foraging search and is called Foraging-directed Adaptive Linear Programming (FALP). Two design studies are presented to illustrate the effectiveness and behavior of the algorithm.

Original languageEnglish
Title of host publication22nd Design Automation Conference
PublisherAmerican Society of Mechanical Engineers (ASME)
ISBN (Electronic)9780791897591
DOIs
StatePublished - 1996
EventASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference, DETC-CIE 1996 - Irvine, United States
Duration: Aug 18 1996Aug 22 1996

Publication series

NameProceedings of the ASME Design Engineering Technical Conference
Volume3

Conference

ConferenceASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference, DETC-CIE 1996
Country/TerritoryUnited States
CityIrvine
Period08/18/9608/22/96

Fingerprint

Dive into the research topics of 'Foraging-directed adaptive linear programming: An algorithm for solving nonlinear mixed discrete/continuous design problems'. Together they form a unique fingerprint.

Cite this