The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach
The semi-continuous quadratic mixture design problem (SCQMDP) is described as a problem with linear, quadratic and semi-continuity constraints. Moreover, a linear cost objective and an integer valued objective are introduced. The goal is to deal with the SCQMD problem from a branch-and-bound perspective generating robust solutions. Therefore, an algorithm is outlined which identifies instances where decision makers tighten requirements such that no [epsilon]-robust solution exists. The algorithm is tested on several cases derived from industry.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hendrix, Eligius M. T. & Mecking, Carmen J. & Hendriks, Theo H. B., 1996. "Finding robust solutions for product design problems," European Journal of Operational Research, Elsevier, vol. 92(1), pages 28-36, July.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:803-815. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.