An efficient method for obtaining sharp bounds for nonlinear boolean programming problems

P. F. Körner

RAIRO - Operations Research - Recherche Opérationnelle (1992)

  • Volume: 26, Issue: 1, page 113-120
  • ISSN: 0399-0559

How to cite

top

Körner, P. F.. "An efficient method for obtaining sharp bounds for nonlinear boolean programming problems." RAIRO - Operations Research - Recherche Opérationnelle 26.1 (1992): 113-120. <http://eudml.org/doc/105025>.

@article{Körner1992,
author = {Körner, P. F.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {Lagrange duality; Boolean programming; quadratic equality constraints; branch and bound},
language = {eng},
number = {1},
pages = {113-120},
publisher = {EDP-Sciences},
title = {An efficient method for obtaining sharp bounds for nonlinear boolean programming problems},
url = {http://eudml.org/doc/105025},
volume = {26},
year = {1992},
}

TY - JOUR
AU - Körner, P. F.
TI - An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1992
PB - EDP-Sciences
VL - 26
IS - 1
SP - 113
EP - 120
LA - eng
KW - Lagrange duality; Boolean programming; quadratic equality constraints; branch and bound
UR - http://eudml.org/doc/105025
ER -

References

top
  1. 1. M. S. BAZARAA and J. J. GOODE, A Survey of Various Tactics for Generating Lagrange Multipliers, Eur. J. Oper. Res., 1979, 3, pp. 322-338. Zbl0405.90062MR534961
  2. 2. R. FLETCHER, Practical Methods of Optimization, John Wiley, Chichester, 1981. Zbl0474.65043MR1867781
  3. 3. F. FORGO, Nemkonvex es diskret prograozas, Közgazdasagi es Jogi Könyvkiado, 1978. 
  4. 4. P. L. HAMMER, Boolean Elements in Combinatorial Optimization a Survey, in B. Roy Ed., Combinatorial programming: Methods and Appl., Reidel, Dortrecht, 1975, pp. 67-92. Zbl0312.90042MR395813
  5. 5. P. HANSEN, Quadratic zero-one programming by implicit emimeration in F. A. Lootsma Ed., Numerical methods in nonlinear optimization, Academic Press, New York, 1972, pp. 265-278. Zbl0267.90071MR384129
  6. 6. P. HANSEN, Methods of nonlinear 0-1 programming, Ann. Discrete Math., 1979, 5, pp. 53-70. Zbl0426.90063MR558567
  7. 7. K. HARTMANN, Verfahren zur Lösung ganzzahliger nichtlinearer Optimierungsprobleme, MOS, Series Optimization, 1977, 8, pp. 633-647. Zbl0388.90048MR469264
  8. 8. F. KÖRNER, An Efficient Branch and Bound Algorithm to Solve the Quadratic Integer Programming Problem, Computing, 1983, 30, pp. 253-260. Zbl0494.65035MR703773
  9. 9. F. KÖRNER and C. RICHTER, Zur effektiven Lösung von booleschen quadratischen Optimierungsproblemen, Num. Math., 1982, 40, pp. 99-109. Zbl0493.90059MR681816
  10. 10. F. KÖRNER, A Tigth Bound for the Boolean Quadratic Optimization Problem and its use in a Branch and Bound Algorithm, Optimization, 1988, 19, pp. 711-721. Zbl0658.90066MR960439
  11. 11. B. KALANTARI and J. B. ROSEN, Penalty Formulation for Zero-One Nonlinear Programming, Discrete Appl. Math., 1987, 16, pp. 179-182. Zbl0622.90059MR874915
  12. 12. W. OETTLY, Einzelschrittverfahren zur Lösung konvexer und dual-konvexer Minimierungsprobleme, Z.A.M.M., 1974, 54, pp. 343-351. Zbl0281.90058MR356891
  13. 13. M. SINCLAIR, An Exact Penalty Function approach for Nonlinear Integer Programming Problems, Eur. J. Oper. Res., 1986, 27, pp. 50-56. Zbl0625.90061MR855920

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.