Results 21 to 30 of about 253 (176)
Intelligent Systems with Applications, 2022 We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced and repaired (remanufacturing) items ...
M. Forkan, M.M. Rizvi, M.A.M. Chowdhury
doaj +1 more source
The complexity of optimizing over a simplex, hypercube or sphere: a short survey [PDF]
, 2006 Computational complexity, Global optimization, Linear and semidefinite programming, Approximation algorithms, 68Q25, 90C30, 90C60,
Etienne Klerk +3 more
core +3 more sources
Unsupervised and supervised data classification via nonsmooth and global optimization [PDF]
, 2003 Clustering, classification, cluster function, nonsmooth optimization, global optimization, 65K05, 90C26, 90C30, 90C90,
A. Bagirov +7 more
core +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
Least Change Secant Update Methods for Nonlinear Complementarity Problem
Ingeniería y Ciencia, 2015 In this work, we introduce a family of Least Change Secant Update Methods for solving Nonlinear Complementarity Problems based on its reformulation as a nonsmooth system using the one-parametric class of nonlinear complementarity functions introduced by ...
Favián Arenas A +2 more
doaj +1 more source
A filter inexact-restoration method for nonlinear programming [PDF]
, 2008 Filter method, Inexact-restoration, Line search, 49M37, 65K05, 90C30, 90C55,
Cândida Silva +3 more
core +1 more source
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 2021 First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj +1 more source
Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
Open Mathematics, 2019 A new class of generalized convex set-valued maps termed relatively solid generalized cone-subconvexlike maps is introduced in real linear spaces not equipped with any topology.
Liang Hongwei, Wan Zhongping
doaj +1 more source
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
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