An approach to solving the optimization problem under uncertainty

被引:7
|
作者
Ostrovsky, GM
Volin, YM
Senyavin, MM
机构
[1] State Scientific Centre of Russian Federation, Karpov Institute of Physical Chemistry, Moscow, 103064
关键词
D O I
10.1080/00207729708929398
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Two problems-calculation of the feasibility test and the two-stage optimization problem (TSOP)-arise in the design of engineering systems (chemical processes, electrical circuits) under conditions of uncertainty of original information, and are considered here. The solution of the first problem allows an estimate of the ability of an engineering system to preserve its capacity for work under changing external and internal factors during operations. Solving the TSOP permits an engineering system to preserve its capacity for for work under inexact knowledge of model coefficients. Directly solving both problems requires the use of multiextremal non-differentiable optimization methods. In this paper, methods of solving both problems are suggested, which use only chemical methods of nonlinear programming For calculation of the feasibility test we propose an algorithm based on a spatial branch-and-bound method. Also, an efficient procedure for calculation of an upper estimation of feasibility test is developed. Two algorithms for solving TSOP are given. A distinctive feature of the algorithms is that during execution the upper and the lower estimates of the optimal value of an objective function of TSOP are calculated. The approach is based on the concept of a 'branch-and-bound' method.
引用
收藏
页码:379 / 390
页数:12
相关论文
共 50 条
  • [21] Solving planning under uncertainty: Quantitative and qualitative approach
    Yin, Minghao
    Wang, Jianan
    Gu, Wenxiang
    [J]. THEORETICAL ADVANCES AND APPLICATIONS OF FUZZY LOGIC AND SOFT COMPUTING, 2007, 42 : 612 - +
  • [22] Bi-objective programming approach for solving the metro timetable optimization problem with dwell time uncertainty
    Yang, Xin
    Chen, Anthony
    Ning, Bin
    Tang, Tao
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 97 : 22 - 37
  • [23] Analogy as a strategy for supporting complex problem solving under uncertainty
    Joel Chan
    Susannah B. F. Paletz
    Christian D. Schunn
    [J]. Memory & Cognition, 2012, 40 : 1352 - 1365
  • [24] Analogy as a strategy for supporting complex problem solving under uncertainty
    Chan, Joel
    Paletz, Susannah B. F.
    Schunn, Christian D.
    [J]. MEMORY & COGNITION, 2012, 40 (08) : 1352 - 1365
  • [25] SOLVING THE NEWSVENDOR PROBLEM UNDER PARAMETRIC UNCERTAINTY USING SIMULATION
    Fernando Munoz, David
    Munoz, David Gonzalo
    [J]. 2015 WINTER SIMULATION CONFERENCE (WSC), 2015, : 2078 - 2087
  • [26] The min-p robust optimization approach for facility location problem under uncertainty
    Lai, Zhizhu
    Yue, Qun
    Wang, Zheng
    Ge, Dongmei
    Chen, Yulong
    Zhou, Zhihong
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (02) : 1134 - 1160
  • [27] The min-p robust optimization approach for facility location problem under uncertainty
    Zhizhu Lai
    Qun Yue
    Zheng Wang
    Dongmei Ge
    Yulong Chen
    Zhihong Zhou
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 1134 - 1160
  • [28] Dynamic Network Design Problem under Demand Uncertainty: An Adjustable Robust Optimization Approach
    Sun, Hua
    Gao, Ziyou
    Zhao, Fangxia
    [J]. DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2014, 2014
  • [29] A two-stage robust optimization approach for the berth allocation problem under uncertainty
    Liu, Changchun
    Xiang, Xi
    Zheng, Li
    [J]. FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2020, 32 (02) : 425 - 452
  • [30] A two-stage robust optimization approach for the berth allocation problem under uncertainty
    Changchun Liu
    Xi Xiang
    Li Zheng
    [J]. Flexible Services and Manufacturing Journal, 2020, 32 : 425 - 452