𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An LP/NLP based branch and bound algorithm for convex MINLP optimization problems

✍ Scribed by I. Quesada; I.E. Grossmann

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
1009 KB
Volume
16
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

General Further Discarding Tests in Geom
General Further Discarding Tests in Geometric Branch-and-Bound Methods for Non-Convex Multicriteria Optimization Problems
✍ Daniel Scholz πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 387 KB

## ABSTRACT Using a geometric branch‐and‐bound technique, my goal in this paper is to compute a sharp outer approximation of all Pareto‐optimal solutions in multicriteria optimization problems. To this end, I propose some general further discarding tests that are based on the Fritz John necessary c