https://doi.org/10.2307/2582400 • https://www.jstor.org/stable/2582400 Copy URL This paper offers a new approach to the solution of zero-one goal-programming ...

An efficient algorithm for solving linear goal programming problems using partitioning and elimination procedures is presented. The algorithm takes advantage of the definition of ordinal preemptive ...

We propose dual decomposition and solution schemes for multistage CVaR-constrained problems. These schemes meet the need for handling multiple CVaR-constraints for different time frames and at ...

On Monday the 2nd of December 2019, M.Sc. Paul Saikko will defend his doctoral thesis on Implicit Hitting Set Algorithms for Constraint Optimization. The thesis is a part of research done in the ...

Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...

If you’ve ever completed a sudoku puzzle, then you’ve completed a constraint satisfaction problem (CSP). This type of problem is defined as a mathematical question where a number of constraints or ...

We propose dual decomposition and solution schemes for multistage CVaRconstrained problems. These schemes meet the need for handling multiple CVaR constraints for different time frames and at ...