Recent contributions to linear semi-infinite optimization: an update

被引:0
作者
M. A. Goberna
M. A. López
机构
[1] University of Alicante,Department of Mathematics
[2] Federation University of Australia,undefined
来源
Annals of Operations Research | 2018年 / 271卷
关键词
Linear semi-infinite optimization; Theory; Methods; Applications;
D O I
暂无
中图分类号
学科分类号
摘要
This paper reviews the state-of-the-art in the theory of deterministic and uncertain linear semi-infinite optimization, presents some numerical approaches to this type of problems, and describes a selection of recent applications in a variety of fields. Extensions to related optimization areas, as convex semi-infinite optimization, linear infinite optimization, and multi-objective linear semi-infinite optimization, are also commented.
引用
收藏
页码:237 / 278
页数:41
相关论文
共 530 条
[1]  
Agmon S(1954)The relaxation method for linear inequalities Canadian Journal of Mathematics 6 382-392
[2]  
Ahmed F(2013)Copositive programming via semi-infinite optimization Journal of Optimization Theory and Applications 159 322-340
[3]  
Dür M(2011)Mission-based component testing for series systems Annals of Operations Research 186 1-22
[4]  
Still G(2013)The design of mission-based component test plans for series connection of subsystems IIE Transactions 45 1202-1220
[5]  
Altinel IK(2001)Simplex-like trajectories on quasi-polyhedral convex sets Mathematics of Operations Research 26 147-162
[6]  
Çekyay BÇ(1989)An extension of the simplex algorithm for semi-infinite linear programming Mathematical Programming 44A 247-269
[7]  
Feyzioğlu O(2016)The set of target vectors of a semi-infinite linear programming problem with a duality gap. (Russian) Tr Inst. Mat. Mekh. 22 43-52
[8]  
Keskin ME(2012)An empirical study on coalition formation and cost/savings allocation International Journal of Production Economics 136 13-27
[9]  
Özekici S(2015)Comparative study of RPSALG algorithms for convex semi-infinite programming Computational Optimization and Applications 60 59-87
[10]  
Altinel IK(2009)Penalty and smoothing methods for convex semi-infinite programming Mathematics of Operations Research 34 303-319