登录
首页 » PDF » two-stage robust optimization

two-stage robust optimization

于 2020-12-07 发布 文件大小:328KB
0 468
下载积分: 1 下载次数: 37

代码说明:

  我们提出了一种列和约束生成算法来解决两阶段鲁棒优化问题。 与现有的Benders式切割平面方法相比,柱式和约束生成算法是一种通用的程序,采用统一的方法来处理最优性和可行性。 对两阶段稳健位置传输问题的计算研究表明,它的执行速度提高了一个数量级。(we present a column-and-constraint generation algorithm to solve two-stage robust optimization problems. Compared with existing Benders-style cutting plane methods, the column-and constraint generation algorithm is a general procedure with a unified approach . A computational study on a two-stage robust location-transportation problem shows that it performs an order of magnitude faster.)

文件列表:

Solving two-stage robust optimization problems using a column-and-constraint generation method.pdf, 393447 , 2018-07-06

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • IMM_nonliner
    此程序为机动目标的非线性滤波器的设计,具有一定的实用价值(This program design of nonlinear filters for maneuvering targets, has some practical value)
    2012-08-02 21:39:35下载
    积分:1
  • MotionDetectionexample
    MATLAB100个编程实例 易读MATLAB100个编程实例 易读MATLAB100个编程实例 易读(very good very goodvery good)
    2010-11-05 20:48:24下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • final
    matlab GUI for a water level detector using the computer s serial port
    2013-08-09 16:24:26下载
    积分:1
  • 01713903
    paper based on algorithm to find out moment invariants
    2011-12-29 22:22:55下载
    积分:1
  • 2110771_RKDG-Euler
    说明:  Galerkin method,a numerical approximate method based on,commonly used in ordinary differential equation.
    2019-12-25 20:17:31下载
    积分:1
  • MatlabSimulinkSimulinkModelingTutorialTrainSystem
    Matlab book Engineering Matlab Programming Engineering Matlab Programming
    2009-03-19 20:00:33下载
    积分:1
  • num2str
    主要用于matlab中的一些基本方法的介绍 以一些功能简介,适合初学matlab用户(used for matlab)
    2012-05-12 08:25:39下载
    积分:1
  • 146
    signal analysis using fft in matlab.
    2014-08-20 18:19:43下载
    积分:1
  • totalvariation
    利用全变差模型对图像实现去噪、去卷积、复原等功能(Total variation model using the image to achieve denoising, deconvolution, and recovery functions)
    2010-08-18 14:33:35下载
    积分:1
  • 696516资源总数
  • 106461会员总数
  • 1今日下载