𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach

✍ Scribed by Bhagyesh V. Patil; P. S. V. Nataraj; Sharad Bhartiya


Publisher
Springer Vienna
Year
2011
Tongue
English
Weight
225 KB
Volume
94
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


An approximate approach of global optimi
✍ Han-Lin Li; Ching-Ter Chang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 626 KB

Many methods for solving polynomial programming problems can only find locally optimal solutions. This paper proposes a method for finding the approximately globally optimal solutions of polynomial programs. Representing a bounded continuous variable xi as the addition of a discrete variable dj and

Global optimization of mixed-integer non
✍ C. S. Adjiman; I. P. Androulakis; C. A. Floudas πŸ“‚ Article πŸ“… 2000 πŸ› American Institute of Chemical Engineers 🌐 English βš– 406 KB πŸ‘ 2 views

## Abstract Two novel deterministic global optimization algorithms for nonconvex mixed‐integer problems (MINLPs) are proposed, using the advances of the Ξ±BB algorithm for nonconvex NLPs of Adjiman et al. The special structure mixed‐integer Ξ±BB algorithm (SMIN‐αBB) addresses problems with nonconvexi

An optimal control approach to nonlinear
✍ H.W.J. Lee; K.L. Teo; X.Q. Cai πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 984 KB

Motivated by the recent developments of the Control Parametrization Enhancing Technique (CPET), a novel method for solving a general cleee of nonlinear mixed integer prcgramming problems is introduced in thii paper. By imposing appropriate dynamice as well ee a set of statistical variance type of fu