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

An approximate approach of global optimization for polynomial programming problems

โœ Scribed by Han-Lin Li; Ching-Ter Chang


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
626 KB
Volume
107
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 a small variable E,, a polynomial term xixi can be expanded as the sum of d,xj, dj&; and E,E,. A procedure is then developed to fully linearize din, and djci, and to approximately linearize E;C~ with an error below a pre-specified tolerance. This linearization procedure can also be extended to higher order polynomial programs. Several polynomial programming examples in the literature are tested to demonstrate that the proposed method can systematically solve these examples to find the global optimum within a pre-specified error.


๐Ÿ“œ SIMILAR VOLUMES


A unified, polynomial approach for the a
โœ C.A. Rossit; P.A.A. Laura ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 287 KB

The present paper, of a tutorial nature, solves two different thermoelastic problems using a unified approach: (a) thermoelastic stresses and deflections in thin, rectangular plates with edges elastically restrained against rotation when small-deflection theory is used and stress resultants in the m

Synthesis of optimal heat exchange syste
โœ Shigenobu Kobayashi; Tomio Umeda; Atsunobu Ichikawa ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 661 KB

A systematic way of synthesizing an optimal heat exchange system is proposed. The method consists in formulating the problem as an optimal assignment problem in linear programming, and of carrying out the optimal design of the synthesized system by the Complex method.

Convergence rate for an approximation ap
โœ Y. Liu; K.L. Teo ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 389 KB

In a recent paper by Fisher et al. (1989, A constrained /-F smooth optimization technique. Proc. 28th CDC, Florida, U.S.A.), a smooth approximation technique is proposed to solve a general class of constrained Hยฎ-norm optimization problems. The aim of this paper is to show that such approximation ha