Implicit Treatment of "Zero or Range" Constraints in a Model for Minimum Cost Foundry Alloys

P. Hansen and J. Hugé
Additional contact information
P. Hansen: RUTCOR, Hill Center, Rutgers University, New Brunswick, New Jersey 08903
J. Hugé: CARLAM, S.A., Charleroi, Belgium

Management Science, 1989, vol. 35, issue 3, 367-371

Abstract: A major problem in foundries is to select scrap alloys and pure metals in order to produce at minimum cost alloy of specified composition. We show that such problems, of realistic size, can be solved optimally by mixed-integer programming. Constraints are that the content of the alloys in various metals must be within given ranges and that the selected amount of each scrap alloy must be either zero or within a given range. The latter "zero or range" constraints can be treated implicitly in a similar way as lower and upper bounds are treated implicitly in bounded variables linear programming. Computation times for representative problems are thus reduced by a factor of three.

Keywords: programming; mixed-integer; implicit constraints; foundry (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.35.3.367 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:35:y:1989:i:3:p:367-371

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().