Results 31 to 40 of about 57,800 (281)

On generalized surrogate duality in mixed-integer nonlinear programming [PDF]

open access: yesMathematical Programming, 2020
AbstractThe most important ingredient for solving mixed-integer nonlinear programs (MINLPs) to global $$\epsilon $$ ϵ -optimality with spatial branch and bound is a tight, computationally tractable relaxation. Due to both theoretical and practical considerations, relaxations of MINLPs are usually required to be convex.
Benjamin Müller   +5 more
openaire   +5 more sources

Interrupted searches in the BBMCSFilter context for MINLP problems [PDF]

open access: yes, 2016
The BBMCSFilter method was developed to solve mixed integer nonlinear programming problems. This kind of problems have integer and continuous variables and they appear very frequently in process engineering problems.
Costa, M. Fernanda P.   +2 more
core   +2 more sources

Optimal Antibody Purification Strategies Using Data-Driven Models

open access: yesEngineering, 2019
This work addresses the multiscale optimization of the purification processes of antibody fragments. Chromatography decisions in the manufacturing processes are optimized, including the number of chromatography columns and their sizes, the number of ...
Songsong Liu, Lazaros G. Papageorgiou
doaj   +1 more source

An Integrated CP/OR Method for Optimal Control of Modular Hybrid Systems [PDF]

open access: yes, 2014
This paper concerns the optimal control of modular hybrid systems synchronized by shared variables. Instead of synchronizing the discrete dynamics of the system into one global mode before optimization, Constraint Programming (CP) is used to model the ...
Lennartson, Bengt, Wigström, Oskar
core   +1 more source

Non-convex mixed-integer nonlinear programming: A survey

open access: yesSurveys in Operations Research and Management Science, 2012
Abstract A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available.
Burer, S, Letchford, Adam
openaire   +2 more sources

A Comprehensive Approach for an Approximative Integration of Nonlinear-Bivariate Functions in Mixed-Integer Linear Programming Models

open access: yesMathematics, 2022
As decentralized energy supply units, microgrids can make a decisive contribution to achieving climate targets. In this context, it is particularly important to determine the optimal size of the energy components contained in the microgrids and their ...
Maximilian Roth   +2 more
doaj   +1 more source

Design of a Logistics Nonlinear System for a Complex, Multiechelon, Supply Chain Network with Uncertain Demands

open access: yesComplexity, 2018
Industrial systems, such as logistics and supply chain networks, are complex systems because they comprise a big number of interconnected actors and significant nonlinear and stochastic features.
Aaron Guerrero Campanur   +4 more
doaj   +1 more source

Generalized Benders Decomposition Method to Solve Big Mixed-Integer Nonlinear Optimization Problems with Convex Objective and Constraints Functions

open access: yesEnergies, 2021
The paper presents the Generalized Benders Decomposition (GBD) method, which is now one of the basic approaches to solve big mixed-integer nonlinear optimization problems.
Andrzej Karbowski
doaj   +1 more source

A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming

open access: yes, 2019
Mixed integer nonlinear programs (MINLPs) are arguably among the hardest optimization problems, with a wide range of applications. MINLP solvers that are based on linear relaxations and spatial branching work similar as mixed integer programming (MIP ...
A Forsgren   +37 more
core   +1 more source

Using Functional Programming to recognize Named Structure in an Optimization Problem: Application to Pooling [PDF]

open access: yes, 2016
Branch-and-cut optimization solvers typically apply generic algorithms, e.g., cutting planes or primal heuristics, to expedite performance for many mathematical optimization problems.
Ceccon, F, Kouyialis, G, Misener, R
core   +1 more source

Home - About - Disclaimer - Privacy