Results 11 to 20 of about 411 (101)
Properties of solutions of optimization problems for set functions
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 7, Page 399-408, 2001., 2001 A definition of a special class of optimization problems with set functions is given. The existence of optimal solutions and first‐order optimality conditions are proved. This case of optimal problems can be transformed to standard mixed problems of mathematical programming in Euclidean space.
Slawomir Dorosiewicz
wiley +1 more source
Intersection cuts from multiple rows: a disjunctive programming approach
EURO Journal on Computational Optimization, 2013 We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming.
Egon Balas, Andrea Qualizza
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
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
EURO Journal on Computational Optimization, 2017 This paper provides the convex hull description of the single thermal Unit Commitment (UC) problem with the following basic operating constraints: (1) generation limits, (2) start-up and shut-down capabilities, and (3) minimum up and down times.
C. Gentile, G. Morales-España, A. Ramos
doaj +1 more source
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
EURO Journal on Computational Optimization, 2020 In state-of-the-art mixed-integer programming solvers, a large array of reduction techniques are applied to simplify the problem and strengthen the model formulation before starting the actual branch-and-cut phase.
Patrick Gemander +5 more
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
Ten years of feasibility pump, and counting
EURO Journal on Computational Optimization, 2019 The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104, 2005), which introduced the heuristic for 0–1 mixed-integer linear programs, has been ...
Timo Berthold +2 more
doaj +1 more source
Switch 2.0: A modern platform for planning high-renewable power systems
SoftwareX, 2019 Switch 2.0 is an open-source platform for planning transitions to low-emission electric power systems, designed to satisfy 21st century grid planning requirements.
Josiah Johnston +3 more
doaj +1 more source
Optimal capacitated ring trees
EURO Journal on Computational Optimization, 2016 We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees.
Alessandro Hill, Stefan Voß
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