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
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
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 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
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
On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness
Axioms, 2021 In this paper, we establish sufficient Karush–Kuhn–Tucker (for short, KKT) conditions of a set-valued semi-infinite programming problem (SP) via the notion of contingent epiderivative of set-valued maps. We also derive duality results of Mond–Weir (MWD),
Koushik Das, Savin Treanţă
doaj +1 more source
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
Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints [PDF]
Yugoslav Journal of Operations Research, 2019 In this paper, we consider a special class of optimization problems which contains infinitely many inequality constraints and finitely many complementarity constraints known as the semi-infinite mathematical programming problem with equilibrium ...
Singh Kunwar V.K. +2 more
doaj +1 more source
International Journal for Simulation and Multidisciplinary Design Optimization, 2020 In this paper, we study a nonsmooth semi-infinite multi-objective E-convex programming problem involving support functions. We derive sufficient optimality conditions for the primal problem.
Emam Tarek
doaj +1 more source
Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems
Abstract and Applied Analysis, 2016 We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and
D. Barilla, G. Caristi, A. Puglisi
doaj +1 more source