Results 21 to 30 of about 2,967,183 (293)

Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions [PDF]

open access: yesYugoslav 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]

open access: yesControl 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

open access: yesJournal 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

On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness

open access: yesAxioms, 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

Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems

open access: yesAbstract 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

Optimality and duality for nonsmooth semi-infinite E-convex multi-objective programming with support functions

open access: yesInternational 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

Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints [PDF]

open access: yesYugoslav 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

Eigenvalue of a semi-infinite elastic strip [PDF]

open access: yes, 2006
A semi-infinite elastic strip, subjected to traction free boundary conditions, is studied in the context of in-plane stationary vibrations. By using normal (Rayleigh–Lamb) mode expansion the problem of existence of the strip eigenmode is reformulated in ...
Pichugin, AV   +5 more
core   +1 more source

Parametric linear semi-infinite programming [PDF]

open access: yes, 1996
By using the theory of parametric semi-infinite programming, we show that the solution of a linear semi-infinite programming problem can be obtained by solving a sequence of optimization problems with a single ...
Wu, Soon-Yi, Lin, C.-J., Fang, S.-C.
core   +1 more source

A projected lagrangian algorithm for semi-infinite programming [PDF]

open access: yesMathematical Programming, 1985
The authors consider nonlinear semi-infinite optimization problems of type min\(\{\) f(a)\(|\) g(x,a)\(\leq 0\) for all \(x\in X\}\) with a box \(X\subset {\mathbb{R}}^ N\), and \(C^ 2\)-functions f, g. Under appropriate regularity assumptions one may consider the local maxima (w.r.t. variable x) of g(x,a) as functions \(x^ i(a)\) of a, and the problem
Ian D. Coope, G. Alistair Watson
openaire   +3 more sources

Home - About - Disclaimer - Privacy