Linear semi-infinite programming (LSIP) is a branch of optimisation that focuses on problems where a finite number of decision variables is subject to infinitely many linear constraints. This ...

Sequential optimality conditions for constrained optimization are necessarily satisfied by local minimizers, independently of the fulfillment of constraint qualifications. These conditions support the ...

Inverse optimisation and linear programming have emerged as crucial instruments in addressing complex decision-making problems where underlying models must be inferred from observed behaviour. At its ...

Abstract: Power has become the primary constraint in high performance computing. Traditionally, parallel job scheduling policies have been designed to improve certain job performance metrics when ...

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer ...

We investigate in this paper the Lagrangian duality properties of linear equality constrained binary quadratic programming. We derive an underestimation of the duality gap between the primal problem ...

Abstract: This paper studies the trajectory planning problem for Unmanned Aerial Vehicles (UAVs) to avoid randomly moving obstacles. We model the problem in a chance-constrained trajectory ...