Optimization Online

When linearizing binary quadratic programs, the most usual way is to replace bilinear products with additional variables constrained to take on consistent values in any feasible solution. In this setting, column generation is a principally desirable solution technique, for instance because the number of such additional linearization variables may be large while many of them ... ...

We consider the probabilistic traveling salesman problem (PTSP) in which customer presences are Bernoulli random variables, and the objective is to determine an a priori tour minimizing the expected traveling cost of the a posteriori tour obtained by skipping absent customers after customer presence is revealed. The existing literature has established that, given an a ...

Flutter is traditionally delayed by modifying either a structure’s geometry or its stiffness distribution. Here, we show that allowing both to evolve simultaneously can unlock a fundamentally different route to aeroelastic stability. We concurrently optimize the cross-sectional geometry and fiber paths of a composite thin-walled wing–engine system to maximize flutter onset. The ...

We propose a proximal-type algorithm for nonsmooth and nonconvex optimization problems with composite constraints. The constraint is defined by the composition of a locally upper-\(C^2\) outer function with a locally Lipschitz continuous inner mapping. The method is based on an improvement function that balances objective decrease and constraint satisfaction, and on a surrogate ...

Realistic decision problems are inherently multiobjective and uncertain. To manage both of these complexities, robust multiobjective optimization strives to aid the decision maker in finding a decision which is Pareto efficient and is hedged against the worst-case scenario. In this paper, we present a robustness approach which is grounded in the decision maker’s preferences by ....