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
Diameter, Width, Closest Line Pair, and Parametric Searching.
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...
Differential evolution algorithm combined with chaotic pattern search
Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show that the novel hybrid algorithm is effective for nonlinear optimization problems in high dimensional space....
Dijkstra's algorithm revisited: the dynamic programming connexion
Direct calculation of sensitivity to the coefficients of the basic submatrix in parametric linear programming
Directional lipschitzian optimal solutions and directional derivative for the optimal value function in nonlinear mathematical programming
Directions De Majoration D'une Fonction Quasiconvexe Et Applications
We introduce the convex cone constituted by the directions of majoration of a quasiconvex function. This cone is used to formulate a qualification condition ensuring the epiconvergence of a sequence of general quasiconvex marginal functions in finite dimensional spaces.
Discounted dynamic programming on Euclidean spaces
Discounted Markov control processes induced by deterministic systems
This paper deals with Markov Control Processes (MCPs) on Euclidean spaces with an infinite horizon and a discounted total cost. Firstly, MCPs which result from the deterministic controlled systems will be analyzed. For such MCPs, conditions that permit to establish the equation known in the literature of Economy as Euler’s Equation (EE) will be given. There will be also presented an example of a Markov Control Process with deterministic controlled system where, to obtain the optimal value function,...
Discrepancy Method for Solving Multistage Minimization Problem
Discrete facility location with nonlinear facility costs
Discrete optimal control problems with nonsmooth costs
Discrete stochastic dynamics of income inequality in education: An applied stochastic model and a case study.
Discrete time optimal dividend problem with constant premium and exponentially distributed claims
An optimal dividend problem is studied consisting in maximisation of expected discounted dividend payments until ruin time. A solution of this problem for constant premium d and exponentially distributed claims is presented. It is shown that an optimal policy is a barrier policy. Moreover, an analytic way to solve this problem is sketched.