In the traditional framework, social welfare functions depend on the mean income and on the income inequality. An alternative illfare framework has been developed to take into account the disutility of unfavorable variables. The illfare level is assumed to increase with the inequality of the distribution. In some social and economic fields, such as those related to employment, health, education...

We model a dependency graph as a book, a particular kind of topological space, for semantic dependency parsing. The spine of the book is made up of a sequence of words, and each page contains a subset of noncrossing arcs. To build a semantic graph for a given sentence, we design new Maximum Subgraph algorithms to generate noncrossing graphs on each page, and a Lagrangian Relaxation-based algori...

The method of controlled Lagrangians is a technique for stabilizing relative equilibria of mechanical systems with symmetry. This paper develops a modification of kinetic shaping technique in the theory of controlled Lagrangians. The main idea is that the dynamics associated with the controlled Lagrangian is amended by non-conservative forces that act in the shape directions; this gives additio...

This paper considers a single-machine scheduling problem where the decision authorities and information are distributed in multiple sub-production systems. Sub-production systems share the single-machine and must cooperate with each other to achieve a global goal of minimizing a linear function of the completion times of the jobs; e.g., total weighted completion times. It is assumed that neithe...

This paper presents a fast and effective approach to cell-type selection and Vth assignment. In our approach, initially a solution without slew and load violation is generated. Then, the Lagrangian Relaxation considering delay sensitivities is used to reduce leakage power keeping the circuit without violations. If the set of cell-types given by Lagrangian Relaxation produces a circuit with nega...

An important traffic engineering problem for OSPF networks is the determination of optimal link weights. Needless to say, this can depend on the traffic engineering objective. Regardless, often a variety of performance measures may be of interest to a network provider due to their impact on the network. In this paper, we consider different objectives and discuss how they impact the determinatio...

A central problem of branch and bound methods for global optimization is that lower bounds are often not exact even if the diameter of the subdivided regions shrinks to zero This can lead to a large number of subdivisions preventing the method from terminating in reasonable time For the all quadratic optimization problem with convex constraints we present locally exact lower bounds and optimali...

Distribution network design (DND) attempts to integrate tactical issues such as inventory policies and/or vehicle routing decisions with strategic ones such as the problem of locating facilities and allocate customers to such facilities. When inventory policy decision making is considered the problem is also known as inventory location modelling (ILM) problem. During the last two decades, mathe...

An algorithmic framework is presented for optimising general convex functions by non synchronised parallel processes. Each process greedily picks a suitable adaptive subset of coordinates and runs a bundle method on a corresponding restricted problem stopping whenever a descent step is encountered or predicted decrease is reduced sufficiently. No prior knowledge on the dependencies between vari...

By combining neural network optimization ideas with “Lagrangian relaxation” for constraint handling, a novel Lagrangian relaxation neural network (LRNN) has recently been developed for job shop scheduling. This paper is to explore architectural design issues for the hardware implementation of such neural networks. A digital circuitry with a micro-controller and an optimization chip is designed,...