Feature extraction algorithms for constrained global optimization. II: Batch process scheduling application

DOI10.1007/BF02023178zbMath0794.90041OpenAlexW2025128019MaRDI QIDQ2368103

Gintaras V. Reklaitis, Athanasios G. Tsirukis

Publication date: 23 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023178

zbMATH Keywords

nonconvex mixed integer nonlinear programmingfeature extraction algorithmsheuristic mutation strategymultiple local optimaoptimal scheduling of multipurpose chemical plants

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• GAMS
• MINOS

Cites Work

• Feature extraction algorithms for constrained global optimization. I: Mathematical foundation
• Inclusion functions and global optimization
• Some NP-complete problems in quadratic and nonlinear programming
• Unnamed Item

This page was built for publication: Feature extraction algorithms for constrained global optimization. II: Batch process scheduling application