We derive an important property for solving large-scale integer programs by examining the master problem in Dantzig–Wolfe decomposition. In particular, we prove that if a linear program can be divided into subproblems with affinely independent corner points, then there is a direct mapping between basic feasible solutions in the master and original problems. This has implications for integer pro...

It has been noticed that during the initial semesters of Computing Engineering that the amount of human tutors is insufficient. The students/tutors ratio is very high and there is a great difference in the acquired knowledge and backgrounds. The idea is that a system could emulate the human tutor and besides provide the student with a degree of flexibility for the selection of the most adequate...

Artificial Bee Colony (ABC) algorithm simulates the foraging behavior of honey bee colonies. ABC is an optimization technique, which is used in finding the best solution from all feasible solutions. However, there is still an insufficiency in ABC regarding improvement in exploitation and convergence speed. In order to improve the performance of ABC we embedded PSO into ABC. As PSO has memory, k...

INTRODUCTION: The appropriate-use optimization of the limited spaces of the Iranian hospitals is believed to be a crucial step towards promoting the efficiency of these healthcare centers. The issue determining the optimization patterns of the layout of units has led to a lot of efforts by researchers as it increases the efficiency of the hospitals through patients’ improvement, changing the lo...

Consider the hyperbolic system of conservation laws u t + F(u) x = 0. Let u be the unique viscosity solution with initial condition u(0; x) = u(x), and let u " be an approximate solution constructed by the Glimm scheme, corresponding to the mesh sizes x, t = O((x). With a suitable choice of the sampling sequence, we prove the estimate u " (t;) ? u(t;) L 1 = o(1) p x ln((x) :

We address the Open Vehicle Routing Problem (OVRP), a variant of the ‘‘classical’’ (capacitated and distance constrained) Vehicle Routing Problem (VRP) in which the vehicles are not required to return to the depot after completing their service. We present a heuristic improvement procedure for OVRP based on Integer Linear Programming (ILP) techniques. Given an initial feasible solution to be po...

We present a stochastic model predictive control (SMPC) framework for linear systems subject to possibly unbounded disturbances. State of the art SMPC approaches with closed-loop chance constraint satisfaction recursively initialize nominal state based on previously predicted or measured under some case distinction. improve these initialization strategies by allowing continuous optimization ove...

The aim of this work was to investigate effect of operational parameters on the photocatalytic degradation efficiency of a solution containing C. I. Basic Blue 41 BB41 in a recirculated rectangular photoreactor irradiated with a UV light. TiO_2 nano composite film was prepared via sol-gel dip coating method. The films were characterized by X-ray diffraction XRD, transmission electron microscopy...

We provide two certificates of convexity for arbitrary basic semialgebraic sets of R. The first one is based on a necessary and sufficient condition whereas the second one is based on a sufficient (but simpler) condition only. Both certificates are obtained from any feasible solution of a related semidefinite program and so can be obtained numerically (however, up to machine precision).

We propose two primal heuristics for nonconvex mixed-integer nonlinear programs. Both are based on the idea of rounding the solution of a continuous nonlinear program subject to linear constraints. Each rounding step is accomplished through the solution of a mixed-integer linear program. Our heuristics use the same algorithmic scheme, but they differ in the choice of the point to be rounded (wh...