拉格朗日乘数
共轭梯度法
离散优化
数学优化
数学
整数(计算机科学)
连续优化
乘数(经济学)
增广拉格朗日法
最优化问题
非线性规划
约束算法
整数规划
约束优化
非线性系统
算法
应用数学
计算机科学
多群优化
经济
程序设计语言
物理
量子力学
宏观经济学
作者
B. K. Kannan,Steven N. Kramer
摘要
An algorithm for solving nonlinear optimization problems involving discrete, integer, zero-one, and continuous variables is presented. The augmented Lagrange multiplier method combined with Powell’s method and Fletcher and Reeves Conjugate Gradient method are used to solve the optimization problem where penalties are imposed on the constraints for integer/discrete violations. The use of zero-one variables as a tool for conceptual design optimization is also described with an example. Several case studies have been presented to illustrate the practical use of this algorithm. The results obtained are compared with those obtained by the Branch and Bound algorithm. Also, a comparison is made between the use of Powell’s method (zeroth order) and the Conjugate Gradient method (first order) in the solution of these mixed variable optimization problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI