Results 11 to 20 of about 68 (67)
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
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
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
EURO Journal on Computational Optimization, 2021 Bilevel optimization is a field of mathematical programming in which some variables are constrained to be the solution of another optimization problem. As a consequence, bilevel optimization is able to model hierarchical decision processes.
Thomas Kleinert +3 more
doaj +1 more source
Open Mathematics, 2017 Nowadays, nature–inspired metaheuristic algorithms are most powerful optimizing algorithms for solving the NP–complete problems. This paper proposes three approaches to find near–optimal Golomb ruler sequences based on nature–inspired algorithms in a ...
Bansal Shonak +2 more
doaj +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
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Open Mathematics, 2017 This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong +3 more
doaj +1 more source
A parametric linearizing approach for quadratically inequality constrained quadratic programs
Open Mathematics, 2018 In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated ...
Jiao Hongwei, Chen Rongjiang
doaj +1 more source
EURO Journal on Computational Optimization, 2016 For many practical applications it is important to determine not only a numerical approximation of one but a representation of the whole set of globally optimal solutions of a non-convex optimization problem.
Gabriele Eichfelder +2 more
doaj +1 more source
EURO Journal on Computational Optimization, 2020 The concept of leader-follower (or Stackelberg) equilibrium plays a central role in a number of real-world applications bordering on mathematical optimization and game theory.
Nicola Basilico +3 more
doaj +1 more source
Open Mathematics, 2018 In this paper, we present an effective algorithm for globally solving quadratic programs with quadratic constraints, which has wide application in engineering design, engineering optimization, route optimization, etc.
Tang Shuai, Chen Yuzhen, Guo Yunrui
doaj +1 more source