scholarly journals Partially distributed outer approximation

2021 ◽  
Author(s):  
Alexander Murray ◽  
Timm Faulwasser ◽  
Veit Hagenmeyer ◽  
Mario E. Villanueva ◽  
Boris Houska
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Outer Approximation ◽  
Mixed Integer ◽  
Global Optimality ◽  
Integer Optimization ◽  
Global Minimizers ◽  
Outer Approximation Method ◽  
Coupling Constraints ◽  
Outer Approximation Algorithm

AbstractThis paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming problems to global optimality. The proposed scheme uses an iterative outer approximation method for coupled mixed integer optimization problems with separable convex objective functions, affine coupling constraints, and compact domain. PaDOA proceeds by alternating between solving large-scale structured mixed-integer linear programming problems and partially decoupled mixed-integer nonlinear programming subproblems that comprise much fewer integer variables. We establish conditions under which PaDOA converges to global minimizers after a finite number of iterations and verify these properties with an application to thermostatically controlled loads and to mixed-integer regression.

scholarly journals Benchmarks for Current Linear and Mixed Integer Optimization Solvers

2015 ◽  
Vol 63 (6) ◽  
pp. 1923-1928 ◽  
Author(s):  
Josef Jablonský
Keyword(s):  
Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Large Scale ◽  
Optimization Problems ◽  
Academic Research ◽  
Mixed Integer ◽  
Important Class ◽  
Integer Optimization ◽  
Computational Performance ◽  
Optimization Solvers

Linear programming (LP) and mixed integer linear programming (MILP) problems belong among very important class of problems that find their applications in various managerial consequences. The aim of the paper is to discuss computational performance of current optimization packages for solving large scale LP and MILP optimization problems. Current market with LP and MILP solvers is quite extensive. Probably among the most powerful solvers GUROBI 6.0, IBM ILOG CPLEX 12.6.1, and XPRESS Optimizer 27.01 belong. Their attractiveness for academic research is given, except their computational performance, by their free availability for academic purposes. The solvers are tested on the set of selected problems from MIPLIB 2010 library that contains 361 test instances of different hardness (easy, hard, and not solved).

Afterword

2010 ◽  
pp. 269-272
Author(s):  
E. Parsopoulos Konstantinos ◽  
N. Vrahatis Michael
Keyword(s):  
Optimization Problems ◽  
Optimization Methods ◽  
Special Structure ◽  
Integer Optimization ◽  
Hybrid Schemes ◽  
Research Results ◽  
Global Minimizers ◽  
Classical Optimization

In the previous chapters, we presented the fundamental concepts and variants of PSO, as along with a multitude of recent research results. The reported results suggest that PSO can be a very useful tool for solving optimization problems from different scientific and technological fields, especially in cases where classical optimization methods perform poorly or their application involves formidable technical difficulties due to the problem’s special structure or nature. PSO was capable of addressing continuous and integer optimization problems, handling noisy and multiobjective cases, and producing efficient hybrid schemes in combination with specialized techniques or other algorithms in order to detect multiple (local or global) minimizers or control its own parameters.

A Mixed-Integer Memetic Algorithm Applied to Batch Process Optimization

2013 ◽  
Vol 300-301 ◽  
pp. 645-648 ◽  
Author(s):  
Yung Chien Lin
Keyword(s):  
Memetic Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Search Space ◽  
Memetic Algorithms ◽  
Batch Processes ◽  
Mixed Integer ◽  
Integer Optimization ◽  
Genetic Operators ◽  
Search Methods

Evolutionary algorithms (EAs) are population-based global search methods. Memetic Algorithms (MAs) are hybrid EAs that combine genetic operators with local search methods. With global exploration and local exploitation in search space, MAs are capable of obtaining more high-quality solutions. On the other hand, mixed-integer hybrid differential evolution (MIHDE), as an EA-based search algorithm, has been successfully applied to many mixed-integer optimization problems. In this paper, a mixed-integer memetic algorithm based on MIHDE is developed for solving mixed-integer constrained optimization problems. The proposed algorithm is implemented and applied to the optimal design of batch processes. Experimental results show that the proposed algorithm can find a better optimal solution compared with some other search algorithms.

scholarly journals About stability of mixed integer optimization problems under perturbations of input data of vector criterion

2021 ◽  
pp. 7-11
Author(s):  
Tetiana Lebedeva ◽  
Natalia Semenova ◽  
Tetiana Sergienko
Keyword(s):  
Initial Data ◽  
Input Data ◽  
Optimization Problems ◽  
Point Of View ◽  
Mixed Integer ◽  
Stability Of Solutions ◽  
Integer Optimization ◽  
Mixed Integer Optimization ◽  
Small Perturbations ◽  
Vector Criterion

The article is devoted to the study of the influence of uncertainty in initial data on the solutions of mixed integer optimization vector problems. In the optimization problems, including problems with vector criterion, small perturbations in initial data can result in solutions strongly different from the true ones. The problem of stability of the indicated tasks is studied from the point of view of direct coupled with her question in relation to stability of solutions belonging to some subsets of feasible set.

scholarly journals Distribution Endpoint Estimation Assessment for the use in Metaheuristic Optimization Procedure

MENDEL ◽  
2018 ◽  
Vol 24 (1) ◽  
pp. 93-100
Author(s):  
Jan Holesovky
Keyword(s):  
Extreme Value Theory ◽  
Large Scale ◽  
Optimization Problems ◽  
Random Search ◽  
Optimization Procedure ◽  
Short Review ◽  
Value Theory ◽  
Extreme Value ◽  
Mixed Integer ◽  
Endpoint Estimation

Metaheuristic algorithms are often applied to numerous optimization problems, involving large-scale and mixed-integer instances, specifically. In this contribution we discuss some refinements from the extreme value theory to the lately proposed modification of partition-based random search. The partition-based approach performs iterative random sampling at given feasible subspaces in order to exclude the less favourable regions. The quality of particular regions is evaluated according to the promising index of a region. From statistical perspective, determining the promising index is equivalent to the endpoint estimation of a probability distribution induced by the objective function at the sampling subspace. In the following paper, we give a short review of the recent endpoint estimators derived on the basis of extreme value theory, and compare them by simulations. We discuss also the difficulties in their application and suitability of the estimators for various optimization instances.

Sign in / Sign up

Export Citation Format

Share Document