Article ID: | iaor20106366 |
Volume: | 47 |
Issue: | 2 |
Start Page Number: | 257 |
End Page Number: | 288 |
Publication Date: | Oct 2010 |
Journal: | Computational Optimization and Applications |
Authors: | Murray Walter, Ng Kien-Ming |
Keywords: | programming: integer |
One of the challenging optimization problems is determining the minimizer of a nonlinear programming problem that has binary variables. A vexing difficulty is the rate the work to solve such problems increases as the number of discrete variables increases. Any such problem with bounded discrete variables, especially binary variables, may be transformed to that of finding a