A MIN-MAX-MAX-MIN APPROACH TO SOLVING A STOCHASTIC-PROGRAMMING PROBLEM WITH SIMPLE RECOURSE

被引:3
作者
WHITE, DJ
机构
关键词
STOCHASTIC PROGRAMMING; ALGORITHM; SADDLE POINT;
D O I
10.1287/mnsc.38.4.540
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper studies a problem of determining the level of certain decisions, taken prior to certain events taking place, and the subsequent additional resource procurement decisions needed to implement the initial program once these events have materialised. The problem is formulated first of all as a max-min problem, and then as an equivalent min-max problem. The min-max problem is easier to solve than the max-min problem. The information provided in solving the min-max problem may be used to facilitate the solution of the max-min problem.
引用
收藏
页码:540 / 554
页数:15
相关论文
共 50 条
  • [21] Lexicographic max-min approach for an integrated vendor-managed inventory problem
    Pasandideh, Seyed Hamid Reza
    Niaki, Seyed Taghi Akhavan
    Niknamfar, Amir Hossein
    KNOWLEDGE-BASED SYSTEMS, 2014, 59 : 58 - 65
  • [22] Solving Max-min Relational Equations. Software and Applications
    Zahariev, Z.
    APPLICATIONS OF MATHEMATICS IN ENGINEERING AND ECONOMICS '34, 2008, 1067 : 516 - 523
  • [23] A Memetic Approach to the Solution of Constrained Min-Max Problems
    Filippi, Gianluca
    Vasile, Massimiliano
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 506 - 513
  • [24] A new approach to solving stochastic programming problems with recourse
    Barreiros, A.
    Cardoso, J. Barradas
    ENGINEERING OPTIMIZATION, 2008, 40 (05) : 475 - 488
  • [25] AN OPTIMIZATION PROBLEM SUBJECT TO THE MAX-MIN FUZZY RELATION INEQUALITIES
    Luo, Haichang
    Zhu, Guocheng
    Lin, Haitao
    Chen, Yanhua
    Zhong, Yubin
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2024, 25 (05) : 1029 - 1038
  • [26] A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem
    Taniguchi, Fumiaki
    Yamada, Takeo
    Kataoka, Seiji
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2009, 86 (05) : 779 - 793
  • [27] An ant colony optimization technique for solving min-max Multi-Depot Vehicle Routing Problem
    Narasimha, Koushik Venkata
    Kivelevitch, Elad
    Sharma, Balaji
    Kumar, Manish
    SWARM AND EVOLUTIONARY COMPUTATION, 2013, 13 : 63 - 73
  • [28] A Min-Max Tchebycheff based Local Search Approach for MOMKP
    Ben Mansour, Imen
    Alaya, Ines
    Tagina, Moncef
    ICSOFT: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON SOFTWARE TECHNOLOGIES, 2017, : 140 - 150
  • [29] A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem
    Godinho, Noe
    Paquete, Luis
    ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 69 - 81
  • [30] A min-max vehicle routing problem with split delivery and heterogeneous demand
    Yakici, Ertan
    Karasakal, Orhan
    OPTIMIZATION LETTERS, 2013, 7 (07) : 1611 - 1625