The branch and bound method with cuts in En+1 for solving concave programing problem
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 180)
II Mathematical Programming II.4 Nonlinear Programming
- 136 Downloads
KeywordsMain Algorithm Polyhedral Cone Outer Approximation Guide Vector Concave Programing
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Bulatov V.P. The methods of solving multiextremal problems (global search). In: The methods of numerical analysis and optimization.-Novosibirsk: nauka, 1987.(in Russian).Google Scholar
- 2.Horst R., Tuy H. Global optimization. Deterministic approaches.— Springer-Verlag, 1990.Google Scholar
- 3.Pardalos P.M., Rosen J.B. Constrained global optimization: Algorithms and Applications.—Lecture Notes in Computer Science, 286, Springer, 1987.Google Scholar
- 4.Bulatov V.P. Embedding methods in Optimization Problems, Nauka, Novosibirsk, 1977 (in Russian).Google Scholar
© International Federation for Information Processing 1992