An algorithm for nonlinear optimization problems with binary variables

  title={An algorithm for nonlinear optimization problems with binary variables},
  author={Walter Murray and Kien Ming Ng},
  journal={Comp. Opt. and Appl.},
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 global optimum of a problem in continuous variables. However, the transformed problems usually have astronomically large… CONTINUE READING
Highly Cited
This paper has 59 citations. REVIEW CITATIONS
33 Citations
34 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 33 extracted citations

59 Citations

Citations per Year
Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 34 references

Nonlinear Programming: Sequential Unconstrained Minimization Techniques

  • A. V. Fiacco, G. P. McCormick
  • Wiley, New York/Toronto
  • 1968
Highly Influential
4 Excerpts

Infeasibility and negative curvature in optimization

  • E. G. Boman
  • Ph.D. thesis, Scientific Computing and…
  • 1999
Highly Influential
3 Excerpts

GAMS/DICOPT: a discrete continuous optimization package

  • I. E. Grossmann, J. Viswanathan, A. Vecchietti, R. Raman, E. Kalvelagen
  • 2003
1 Excerpt

Algorithms for global optimization and discrete problems based on methods for local optimization

  • W. Murray, Ng, K.-M
  • Heuristic Approaches. Handbook of Global…
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…