Results 31 to 40 of about 1,433 (143)
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +1 more source
International Journal of Stochastic Analysis, Volume 2004, Issue 3, Page 235-244, 2004., 2004 We consider a new class of equilibrium problems, known as hemiequilibrium problems. Using the auxiliary principle technique, we suggest and analyze a class of iterative algorithms for solving hemiequilibrium problems, the convergence of which requires either pseudomonotonicity or partially relaxed strong monotonicity. As a special case, we obtain a new
Muhammad Aslam Noor
wiley +1 more source
Asymptotic stationarity and regularity for nonsmooth optimization problems [PDF]
Journal of Nonsmooth Analysis and Optimization, 2020 Based on the tools of limiting variational analysis, we derive a sequential necessary optimality condition for nonsmooth mathematical programs which holds without any additional assumptions. In order to ensure that stationary points in this new sense are
Patrick Mehlitz
doaj +1 more source
Journal of Applied Mathematics, Volume 2004, Issue 5, Page 409-431, 2004., 2004 We consider the problem of projecting a point onto a region defined by a linear equality or inequality constraint and two‐sided bounds on the variables. Such problems are interesting because they arise in various practical problems and as subproblems of gradient‐type methods for constrained optimization.
Stefan M. Stefanov
wiley +1 more source
A reduced space branch and bound algorithm for a class of sum of ratios problems
Open Mathematics, 2018 Sum of ratios problem occurs frequently in various areas of engineering practice and management science, but most solution methods for this kind of problem are often designed for determining local solutions .
Zhao Yingfeng, Zhao Ting
doaj +1 more source
Existence of solutions of minimization problems with an increasing cost function and porosity
Abstract and Applied Analysis, Volume 2003, Issue 11, Page 651-670, 2003., 2003 We consider the minimization problem f(x) → min, x ∈ K, where K is a closed subset of an ordered Banach space X and f belongs to a space of increasing lower semicontinuous functions on K. In our previous work, we showed that the complement of the set of all functions f, for which the corresponding minimization problem has a solution, is of the first ...
Alexander J. Zaslavski
wiley +1 more source
Joint location and pricing within a user-optimized environment
EURO Journal on Computational Optimization, 2020 In the design of service facilities, whenever the behaviour of customers is impacted by queueing or congestion, the resulting equilibrium cannot be ignored by a firm that strives to maximize revenue within a competitive environment.
Teodora Dan +2 more
doaj +1 more source
On generalized derivatives for C1,1 vector optimization problems
Journal of Applied Mathematics, Volume 2003, Issue 7, Page 365-376, 2003., 2003 We introduce generalized definitions of Peano and Riemann directional derivatives in order to obtain second‐order optimality conditions for vector optimization problems involving C1,1 data. We show that these conditions are stronger than those in literature obtained by means of second‐order Clarke subdifferential.
Davide La Torre
wiley +1 more source
Numerical construction of structured matrices with given eigenvalues
Special Matrices, 2019 We consider a structured inverse eigenvalue problem in which the eigenvalues of a real symmetric matrix are specified and selected entries may be constrained to take specific numerical values or to be nonzero.
Sutton Brian D.
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 25, Issue 9, Page 621-628, 2001., 2001 A new method for obtaining sensitivity information for parametric vector optimization problems (VOP) v is presented, where the parameters in the objective functions and anywhere in the constraints. This method depends on using differential equations technique for solving multiobjective nonlinear programing problems which is very effective in finding ...
Fatma M. Ali
wiley +1 more source