Hooker, J.N. Kim, Hak-Jin Ottosson, G.
Published in
Annals of Operations Research

Constraint programming offers modeling features and solution methods that are unavailable in mathematical programming but are often flexible and efficient for scheduling and other combinatorial problems. Yet mathematical programming is well suited to declarative modeling languages and is more efficient for some important problem classes. This raise...

Pryce, J. D.
Published in
BIT Numerical Mathematics

We describe a straightforward method for analysing the structure of a differential-algebraic system. It generalizes the method of Pantelides, but is more directly informative and applies to DAEs with derivatives of any order. It naturally leads to a numerical method for the initial value problem that combines projection and index reduction. We illu...

Morin, T. L. Prabhu, N. Zhang, Z.
Published in
Journal of Optimization Theory and Applications

In the gravitational method for linear programming, a particle is dropped from an interior point of the polyhedron and is allowed to move under the influence of a gravitational field parallel to the objective function direction. Once the particle falls onto the boundary of the polyhedron, its subsequent motion is constrained to be on the surface of...

Goberna, M. A. López, M. A. Todorov, M. I.
Published in
Set-Valued Analysis

This paper deals with the stability of two families of linear optimization problems, each one formed by the dual problems to the members of the other family. We characterize the problems of these families that are stable in the sense that they remain consistent (inconsistent) under sufficiently small arbitrary perturbations of all the data. This ch...

Troutt, M D White, G P Tadisina, S K
Published in
Journal of the Operational Research Society

This paper considers the analysis of process networks with bottlenecks and shows how they may be regarded as simple multi-source maximal flow linear programming problems. We surveyed over 30 Production/Operations Management and management science/OR textbooks, finding that only iterative trial-and-error procedures are now being suggested for this k...

Weir, J D Moore, J T Stoecker, M G
Published in
Journal of the Operational Research Society

We develop an iterative approach for solving a linear programming problem with prioritized goals. We tailor our approach to preemptive goal programming problems and take advantage of the fact that at optimality, most constraints are not binding. To overcome the problems posed by redundant constraints, our procedure ensures redundant constraints are...

Little, J
Published in
Journal of the Operational Research Society

Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can still give a better performance on the same problem types. Central to IP's success is its reliance on a fast Linear Programming (LP) solver providing sol...

Darondeau, Philippe Xie, Xiaolan

Given a linear constraint on the firing vectors of a live marked graph (bounded or unbounded) with uncontrollable / unobservable transitions, we apply linear programming techniques to compute the most liberal controller enforcing this constraint. In the special case of strongly connected live marked graphs, we compute further on the most liberal co...

da Silva, I. N. de Souza, A. N. Bordon, M. E.

Artificial neural networks are dynamic systems consisting of highly interconnected and parallel nonlinear processing elements. Systems based on artificial neural networks have high computational rates due to the use of a massive number of these computational elements. Neural networks with feedback connections provide a computing model capable of so...

Janiak, Adam Kovalyov, Mikhail Y. Portmann, Marie-Claude

A single machine scheduling problem is studied. The set of n jobs has been partitioned into g groups on the basis of group technology. Jobs of the same group are required to be processed contiguously. The processing of each group is preceeded by a sequence independent setup time. The setup times and the job processing times can be linearly compress...