This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the cumulative demand structure allowed us to develop a solution algorithm based on the concept of minimal ...

Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We therefore propose two mechanisms that trade off the solution costs of two DCOP search algorithms (ADOPT and BnB-ADOPT) for smaller runtimes, namely the Inadmissible Heuristics Mechanism and the Relative Error Mechanism. The...

We study the behaviour at the terminal time T of the minimal solution of a backward stochastic differential equation when the terminal data can take the value +∞ with positive probability. In a previous paper [15], we have proved existence of this minimal solution (in a weak sense) in a quite general setting. But two questions arise in this context and were still open: is the solution right con...

The paper addresses the LQ control problem for systems with countable Markov jump parameters, and the associated coupled algebraic Riccati equations. The problem is considered in a general optimization setting in which the solution is not required to be stabilizing in any sense. We show that a necessary and sufficient condition for a solution to the control problem to exist is that the Riccati ...

⎯In this paper we propose a methodology for the solution of multiobjective programming problem with fuzzy relational equations (FRE’s) as constraints. In the first part of the proposed methodology, we find the feasible solution set of FRE’s and give an algorithm to compute minimal solutions and maximal solutions of objective functions which can also be computed by constructed computer program a...

For iterative sequences that converge to the solution set of a linear matrix inequality, we show that the distance of the iterates to the solution set is at most O(2 ?d). The nonnegative integer d is the so{called degree of singularity of the linear matrix inequality, and denotes the amount of constraint violation in the iterate. For infeasible linear matrix inequalities, we show that the minim...

We prove existence and uniqueness of the solution of the Björling problem for minimal surfaces in a tridimensional Lie group.

We study the minimal/endogenous solution R to the maximum recursion on weighted branching trees given by