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

An approach to the construction of approximate solutions of Boolean linear programming problems

โœ Scribed by I. V. Sergienko; V. P. Shilo

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Finding an efficient solution to linear
Finding an efficient solution to linear bilevel programming problem: An effective approach
โœ Ue-Pyng Wen; Sen-Fon Lin ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English โš– 527 KB

Multilevel programming is developed to solve the decentralized problem in which decision makers (DMs) are often arranged within a hierarchical administrative structure. The linear bilevel programming (BLP) problem, i.e., a special case of multilevel programming problems with a two level structure, i

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