.png){kind=icon}
返回
Using Functional Programming to Recognize Named Structure in an Optimization Problem: Application to Pooling
.png){kind=icon}
OA
AI
DOI：10.1002/aic.15308.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Branch-and-cut optimization solvers typically apply generic algorithms, e.g., cutting planes or primal heuristics, to expedite performance for many mathematical optimization problems. But solver software receives an input optimization problem as vectors of equations and constraints containing no structural information. This article proposes automatically detecting named special structure using the pattern matching features of functional programming. Specifically, we deduce the industrially-relevant nonconvex nonlinear Pooling Problem within a mixed-integer nonlinear optimization problem and show that we can uncover pooling structure in optimization problems which are not pooling problems. Previous work has shown that preprocessing heuristics can find network structures; we show that we can additionally detect nonlinear pooling patterns. Finding named structures allows us to apply, to generic optimization problems, cutting planes or primal heuristics developed for the named structure. To demonstrate the recognition algorithm, we use the recognized structure to apply primal heuristics to a test set of standard pooling problems. (C) 2016 The Authors AIChE Journal published by Wiley Periodicals, Inc. on behalf of American Institute of Chemical Engineers
Keyword:
optimization
automatic problem recognition
pooling problem
process networks optimization
functional programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
1.1W
被引数:
2.9W
机构
引用论文
分享收藏分享收藏Development of a checklist for people communicating evidence-based information about the effects of healthcare interventions: a mixed methods study.png)
BMJ OpenOAAI
BMJ OpenIF0
OAAI分享收藏
查看更多内容