Results 31 to 40 of about 1,405 (117)
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
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
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
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
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere [PDF]
, 2019 We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], for the special case when the feasible set is the unit (hyper)sphere.
de Klerk, Etienne, Laurent, Monique
core +2 more sources
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
A remark on Gwinner′s existence theorem on variational inequality problem
International Journal of Mathematics and Mathematical Sciences, Volume 24, Issue 8, Page 573-575, 2000., 2000 Gwinner (1981) proved an existence theorem for a variational inequality problem involving an upper semicontinuous multifunction with compact convex values. The aim of this paper is to solve this problem for a multifunction with open inverse values.
V. Vetrivel, S. Nanda
wiley +1 more source
An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions
EURO Journal on Computational Optimization, 2016 We propose a forward–backward proximal-type algorithm with inertial/memory effects for minimizing the sum of a nonsmooth function with a smooth one in the nonconvex setting.
Radu Ioan Boţ +2 more
doaj +1 more source
An economic order quantity model with reverse logistics program
Operations Research Perspectives, 2020 The economic order quantity (EOQ) model has evolved greatly over past decades on the strength of incorporating realistic factors. In recent times, interest has been geared towards studying the effect of reverse flow of products into inventory system.
S. Sanni, Z. Jovanoski, H.S. Sidhu
doaj +1 more source
General algorithm and sensitivity analysis for variational inequalities
International Journal of Stochastic Analysis, Volume 5, Issue 1, Page 29-41, 1992., 1991 The fixed point technique is used to prove the existence of a solution for a class of variational inequalities related to odd order boundary value problems, and to suggest a general algorithm. We also study the sensitivity analysis for these variational inequalities and complementarity problems using the projection technique.
Muhammad Aslam Noor
wiley +1 more source