Displaying similar documents to “Global optimality conditions for a dynamic blocking problem”

Global optimality conditions for a dynamic blocking problem

Alberto Bressan, Tao Wang (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The paper is concerned with a class of optimal blocking problems in the plane. We consider a time dependent set () ⊂ ℝ, described as the reachable set for a differential inclusion. To restrict its growth, a barrier can be constructed, in real time. This is a one-dimensional rectifiable set which blocks the trajectories of the differential inclusion. In this paper we introduce a definition of “regular strategy”, based on a careful classification...

Homogenization of quasilinear optimal control problems involving a thick multilevel junction of type 3 : 2 : 1

Tiziana Durante, Taras A. Mel’nyk (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We consider quasilinear optimal control problems involving a thick two-level junction which consists of the junction body and a large number of thin cylinders with the cross-section of order 𝒪( ). The thin cylinders are divided into two levels depending on the geometrical characteristics, the quasilinear boundary conditions and controls given on their lateral surfaces and bases respectively. In addition, the quasilinear boundary...

An Extended Opportunity-Based Age Replacement Policy

Bermawi P. Iskandar, Hiroaki Sandoh (2010)

RAIRO - Operations Research

Similarity:

The present study proposes an extended opportunity-based age replacement policy where opportunities occur according to a Poisson process. When the age, of the system satisfies for a prespecified value , a corrective replacement is conducted if the objective system fails. In case satisfies for another prespecified value , we take an opportunity to preventively replace the system by a new one with probability , and do not take the opportunity with probability . At the moment reaches...

Inequality-sum: a global constraint capturing the objective function

Jean-Charles Régin, Michel Rueher (2010)

RAIRO - Operations Research

Similarity:

This paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum , and where the integer variables are subject to difference constraints of the form . An important application area where such problems occur is deterministic scheduling with the as optimality criteria. This new constraint is also more general than a sum constraint defined on a set of ordered variables. Classical...

Trivial Cases for the Kantorovitch Problem

Serge Dubuc, Issa Kagabo, Patrice Marcotte (2010)

RAIRO - Operations Research

Similarity:

Let and be two compact spaces endowed with respective measures and satisfying the condition . Let be a continuous function on the product space . The mass transfer problem consists in determining a measure on whose marginals coincide with and , and such that the total cost be minimized. We first show that if the cost function is decomposable, i.e., can be represented as the sum of two continuous functions defined on and , respectively, then every feasible measure is optimal....