𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Informational, algorithmic, and programming support for solving Blast-Furnace optimization problems

✍ Scribed by D. N. Togobitskaya; A. F. Khamkhot'ko; A. I. Bel'kova

Publisher
Springer US
Year
1999
Tongue
English
Weight
248 KB
Volume
43
Category
Article
ISSN
0026-0894

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Application of particle swarm optimizati
Application of particle swarm optimization algorithm for solving bi-level linear programming problem
✍ R.J. Kuo; C.C. Huang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 436 KB

Bi-level linear programming is a technique for modeling decentralized decision. It consists of the upper-level and lower-level objectives. This paper attempts to develop an efficient method based on particle swarm optimization (PSO) algorithm with swarm intelligence. The performance of the proposed

Informal and Professional Support for So
Informal and Professional Support for Solving Psychological Problems Among Korean-Speaking Immigrants
✍ Jin Yong Shin; Gershon Berkson; Kathleen Crittenden πŸ“‚ Article πŸ“… 2000 πŸ› American Counseling Association 🌐 English βš– 953 KB

Korean American immigrants rated the helpfulness of various sources of social support in addressing 3 psychological problems. Traditionalism was not related to perceived helpfulness of professionals but was significantly related to perceived helpfulness of informal support. Path analysis revealed th

Efficient algorithms for solving rank tw
Efficient algorithms for solving rank two and rank three bilinear programming problems
✍ Yasutoshi Yajima; Hiroshi Konno πŸ“‚ Article πŸ“… 1991 πŸ› Springer US 🌐 English βš– 866 KB

Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: minimize c& + df,y + i c;x-d;y(xEX, yEY , j=l I where XC R"' and Y C RnZ are non