Hazardous waste management incorporates collection, separation, treatment, recycling and disposal of hazardous wastes. In this paper, a new multi-objective mixed integer model is presented for hazardous waste collection problem. The model aims to minimize transportation and construction costs, and environmental and population risks in hazardous waste management systems. This model is applied in...

We consider a class of constrained optimization problems where the objective function is a sum of a smooth function and a nonconvex non-Lipschitz function. Many problems in sparse portfolio selection, edge preserving image restoration and signal processing can be modelled in this form. First we propose the concept of the Karush-Kuhn-Tucker (KKT) stationary condition for the non-Lipschitz proble...

We present an algorithm that achieves superlinear convergence for nonlinear programs satisfying the Mangasarian-Fromovitz constraint qualiication and the quadratic growth condition. This convergence result is obtained despite the potential lack of a locally convex augmented Lagrangian. The algorithm solves a succession of subproblems that have quadratic objective and quadratic constraints, both...

1. Abstract A novel strategy for handling the molding constraint for cast parts is presented. In a first step, a simple projection method for the velocity field is applied. If the optimized shape violates thickness constraints, this projection method is no longer sufficient and a general molding constraint is applied at the same time with thickness control. We apply an augmented Lagrangian meth...

Constraint modelling is difficult, particularly for novices. Hence, automated methods for improving models are valuable. The context of this paper is tailoring, a process where a solver-independent constraint model is adapted to a target solver. Tailoring is augmented with automated enhancement techniques, in particular common subexpression detection and elimination, which, while powerful, can ...

Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. In this paper, we extend the principle of symmetry to dominance in Not-Equals Constraint Networks and show how dominated values are detected and eliminated at each node of the search tree. A Linear time complexity algor...

where f : Rn → R and g : Rn → Rp are nonlinear continuous functions and Ω = {x ∈ Rn : −∞ < l ≤ x ≤ u < ∞}. Problems with equality constraints, h(x) = 0, can be reformulated into the above form by converting into a couple of inequality constraints h(x)− β ≤ 0 and −h(x)− β ≤ 0, where β is a small positive relaxation parameter. Since we do not assume that the objective function f is convex, the pr...

We describe new techniques to allow constraint driven design using spatial augmented reality (SAR), using projectors to animate a physical prop. The goal is to bring the designer into the visual working space, interacting directly with a dynamic design, allowing for intuitive interactions, while gaining access to affordance through the use of physical objects. We address the current industrial ...

The design structure matrix (DSM) and its formal counterpart, the augmented constraint network (ACN), have been used to explicitly model software design decisions, design rules and the resulting modular structure. To address the difficulty of modeling software design in terms of decisions, we formally define the decisions and their assumption relations embedded within UML class diagrams and aut...