Détermination rapide d'une solution de base initiale en programmation linéaire continue
Determining an Optimal Retail Location by Using GIS
Deterministic global optimization using interval constraint propagation techniques
The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.
Deterministic global optimization using interval constraint propagation techniques
The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.
Deterministic Inventory Model for Items With Time Varying Demand, Weibull Distribution Deterioration and Shortages
Deterministic optimal policies for Markov control processes with pathwise constraints
This paper deals with discrete-time Markov control processes in Borel spaces with unbounded rewards. Under suitable hypotheses, we show that a randomized stationary policy is optimal for a certain expected constrained problem (ECP) if and only if it is optimal for the corresponding pathwise constrained problem (pathwise CP). Moreover, we show that a certain parametric family of unconstrained optimality equations yields convergence properties that lead to an approximation scheme which allows us to...
Deterministic state-constrained optimal control problems without controllability assumptions
In the present paper, we consider nonlinear optimal control problems with constraints on the state of the system. We are interested in the characterization of the value function without any controllability assumption. In the unconstrained case, it is possible to derive a characterization of the value function by means of a Hamilton-Jacobi-Bellman (HJB) equation. This equation expresses the behavior of the value function along the trajectories arriving or starting from any position x. In the constrained...
Deterministic state-constrained optimal control problems without controllability assumptions
In the present paper, we consider nonlinear optimal control problems with constraints on the state of the system. We are interested in the characterization of the value function without any controllability assumption. In the unconstrained case, it is possible to derive a characterization of the value function by means of a Hamilton-Jacobi-Bellman (HJB) equation. This equation expresses the behavior of the value function along the trajectories arriving or starting from any position x. In...
Deux algorithmes de programmation mathématique
Deux modèles de minimisation d'une fonction économique concave
Deux problèmes d'affectation non linéaires
Deux problèmes d'ordonnancement en télécommunications par satellite
Deux remarques sur le flot dynamique maximal de coût minimal
Development and marketing strategies for a class of R and D projects, with time independent stochastic returns
Diameter, Width, Closest Line Pair, and Parametric Searching.
Diamètre de graphes et qualité de service d'un réseau de données
Die Aufgaben über die Teilung des Stangenmaterials
Das Hauptziel dieser Publikation war die Auflösung der 1. Etappe von Aufgaben, die die Teilung des Stangenmaterials betreffen, wobei wird für die 2. Etappe dieser Aufgaben die Auswahl optimaler Zusammensetzung der Schnittpläne, die das Abfallprozent minimalisiert behalten. In diesem Artikel wird die Bestimmung eines Katalogs aller Schnittpläne zu gegebenem Zuschnittsverzeichnis behandelt. Diese Problematik ist aktuell auch bei der Bestimmung des Katalogs der Schnittpläne bei der Lösung von Aufgaben,...
Die Lösbarkeit eines linearen Optimierungsproblems unter Zufügung einer weiteren Restriktionsbedingung
Differential approximation of NP-hard problems with equal size feasible solutions
In this paper, we focus on some specific optimization problems from graph theory, those for which all feasible solutions have an equal size that depends on the instance size. Once having provided a formal definition of this class of problems, we try to extract some of its basic properties; most of these are deduced from the equivalence, under differential approximation, between two versions of a problem which only differ on a linear transformation of their objective functions. This is notably...
Differential approximation of NP-hard problems with equal size feasible solutions
In this paper, we focus on some specific optimization problems from graph theory, those for which all feasible solutions have an equal size that depends on the instance size. Once having provided a formal definition of this class of problems, we try to extract some of its basic properties; most of these are deduced from the equivalence, under differential approximation, between two versions of a problem π which only differ on a linear transformation of their objective functions. This is notably...