๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An approach to obtaining global extremums in polynomial mathematical programming problems

โœ Scribed by N. Z. Shor

Publisher
Springer US
Year
1988
Tongue
English
Weight
436 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An approximate approach of global optimi
An approximate approach of global optimization for polynomial programming problems
โœ 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

An integer programming approach to optim
An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks
โœ Koichi Kobayashi; Kunihiko Hiraishi ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 302 KB

A Boolean network is one of the models of biological networks such as gene regulatory networks, and has been extensively studied. In particular, a probabilistic Boolean network (PBN) is well known as an extension of Boolean networks, but in the existing methods to solve the optimal control problem o