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 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
## 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
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