𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique

✍ Scribed by Hanif D. Sherali; Cihan H. Tuncbilek

Publisher
Springer US
Year
1992
Tongue
English
Weight
798 KB
Volume
2
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new linearization technique for multi-
A new linearization technique for multi-quadratic 0–1 programming problems
✍ Wanpracha Chaovalitwongse; Panos M Pardalos; Oleg A Prokopyev πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 205 KB

We consider the reduction of multi-quadratic 0-1 programming problems to linear mixed 0-1 programming problems. In this reduction, the number of additional continuous variables is O(kn) (n is the number of initial 0-1 variables and k is the number of quadratic constraints). The number of 0-1 variabl

Optimization algorithms for a class of n
Optimization algorithms for a class of nonlinear programming problems
✍ S. Chowdhury; M.A. Breuer πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 371 KB

A generalization of the theory of materials of type N to continuum damage mechanics is presented. Then algorithms developed earlier by the authors for plasticity problems are extended and applied to the analysis of progressive damage of materials under large elastoplastic deformation. Results obtain