.png){kind=icon}
返回
Linearly constrained global optimization: a general solution algorithm with applications
.png){kind=icon}
PRE
AI
DOI：10.1016/S0096-3003(01)00289-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an efficient enumerative approach to solve general linearly constrained optimization problems. This class of optimization problems includes fractional, nonlinear network models, quadratic, convex and non-convex programs. The unified approach is accomplished by converting the constrained optimization problem to an unconstrained optimization problem through a parametric representation of its feasible region. The proposed solution algorithm consists of three phases. In phase 1 it finds all interior critical points. In phase 2 the parametric representation of the feasible region is constructed to identify any critical points on the edges and faces of the feasible region. This is done by a modified version of an algorithm for finding the V-representation of the polyhedron. Then, in phase 3, the global optimal value of the objective function is found by evaluating the objective function at the critical points as well as at the vertices. For an illustration of the algorithm and a comparison with the existing methods small-size numerical examples are presented. (C) 2002 Elsevier Science Inc. All rights reserved.
Keyword:
global optimization
linearly constrained optimization
polyhedra
nonlinear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
Is Collective Efficacy Age Graded? The Development and Evaluation of a New Measure of Collective Efficacy for Older Adults集体效能是否按年龄分级？老年人集体效能新量表的编制与评价
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏分享收藏
查看更多内容