首页 | 官方网站   微博 | 高级检索  
     


Solving Problems with Min-Type Functions by Disjunctive Programming
Authors:Mikhail Andramonov
Affiliation:(1) Institute of Mathematics and Mechanics, Universitetskaya St 17, 420008 Kazan, Russia
Abstract:We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.
Keywords:Disjunctive programming  Global optimization  Surrogate constraints
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号