A distributionally robust optimization approach for two-stage facility location problems
EURO Journal on Computational Optimization, 2020 In this paper, we consider a facility location problem where customer demand constitutes considerable uncertainty, and where complete information on the distribution of the uncertainty is unavailable.
Arash Gourtani +2 more
doaj +1 more source
Volumetric Barrier Cutting Plane Algorithms for Stochastic Linear Semi-Infinite Optimization
IEEE Access, 2020 In this paper, we study the two-stage stochastic linear semi-infinite programming with recourse to handle uncertainty in data defining (deterministic) linear semi-infinite programming.
Baha Alzalg, Asma Gafour, Lewa Alzaleq
doaj +1 more source
Optimality conditions and duality for multiobjective semi-infinite programming with data uncertainty via Mordukhovich subdifferential [PDF]
Yugoslav Journal of Operations Research, 2021 Based on the notation of Mordukhovich subdifferential in [27], we propose some of new concepts of convexity to establish optimality conditions for quasi ε−solutions for nonlinear semi-infinite optimization problems with data uncertainty in constraints ...
Pham Thanh-Hung
doaj +1 more source
Computational Performance Analysis of Nonlinear Dynamic Systems using Semi-infinite Programming [PDF]
Modeling, Identification and Control, 2001 For nonlinear systems that satisfy certain regularity conditions it is shown that upper and lower bounds on the performance (cost function) can be computed using linear or quadratic programming.
Tor A. Johansen
doaj +1 more source
Numerical experiments in semi-infinite programming [PDF]
Computational Optimization and Applications, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christopher John Price, Ian D. Coope
openaire +2 more sources
Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems
Journal of Inequalities and Applications, 2016 In this paper, we introduce a notion of Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems in terms of weakly efficient solutions.
Xian-Jun Long +2 more
doaj +1 more source
Optimality Conditions for Nonsmooth Generalized Semi-Infinite Programs
Abstract and Applied Analysis, 2013 We consider a class of nonsmooth generalized semi-infinite programming problems. We apply results from parametric optimization to the lower level problems of generalized semi-infinite programming problems to get estimates for the value functions of the ...
Zhangyou Chen, Zhe Chen
doaj +1 more source
Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions [PDF]
Yugoslav Journal of Operations Research, 2017 In this paper, we consider a nonsmooth semi-infinite multiobjective programming problem involving support functions. We establish sufficient optimality conditions for the primal problem.
Singh Yadvendra, Mishra S.K., Lai K.K.
doaj +1 more source
Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks [PDF]
Control and Optimization in Applied Mathematics, 2016 Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization
Alaeddin Malek +2 more
doaj
A Spline Smoothing Newton Method for Semi-Infinite Minimax Problems
Journal of Applied Mathematics, 2014 Based on discretization methods for solving semi-infinite programming problems, this paper presents a spline smoothing Newton method for semi-infinite minimax problems. The spline smoothing technique uses a smooth cubic spline instead of max function and
Li Dong, Bo Yu, Yu Xiao
doaj +1 more source