Search results for " optimization."

Three-mode pneumatic management of marine U-tank systems

2012

Abstract This paper deals with a new pneumatic control strategy for the roll damping enhancement of marine U-tank stabilizers. The proposed technique consists in a three-mode operation, where the control is active only within a limited resonant range around the ship natural frequency, whereas the control valves are kept closed in the remaining frequency range. Moreover the connection valve between the two air chambers is either closed or partially opened for the low or high frequencies, respectively. The pressurized air for the active control is fed by a turbo-blower set aboard and operates accelerating the motion of the water mass in the U-duct. The theoretical analysis is conducted in the…

Constrained control of a nonlinear two point boundary value problem, I

1994

In this paper we consider an optimal control problem for a nonlinear second order ordinary differential equation with integral constraints. A necessary optimality condition in form of the Pontryagin minimum principle is derived. The proof is based on McShane-variations of the optimal control, a thorough study of their behaviour in dependence of some denning parameters, a generalized Green formula for second order ordinary differential equations with measurable coefficients and certain tools of convex analysis.

Convex Duality in Stochastic Optimization and Mathematical Finance

2011

This paper proposes a general duality framework for the problem of minimizing a convex integral functional over a space of stochastic processes adapted to a given filtration. The framework unifies many well-known duality frameworks from operations research and mathematical finance. The unification allows the extension of some useful techniques from these two fields to a much wider class of problems. In particular, combining certain finite-dimensional techniques from convex analysis with measure theoretic techniques from mathematical finance, we are able to close the duality gap in some situations where traditional topological arguments fail.

Selected Topics from Functional and Convex Analysis

2003

Convex functions on Carnot Groups

2007

We consider the definition and regularity properties of convex functions in Carnot groups. We show that various notions of convexity in the subelliptic setting that have appeared in the literature are equivalent. Our point of view is based on thinking of convex functions as subsolutions of homogeneous elliptic equations.

On some close to convex functions with negative coefficients

2007

In this paper we propose for study a class of close to convex functions with negative coefficients defined by using a modified Salagean operator. .

A comparative study of partitioning methods for crowd simulations

2010

The simulation of large crowds of autonomous agents with realistic behavior is still a challenge for several computer research communities. In order to handle large crowds, some scalable architectures have been proposed. Nevertheless, the effective use of distributed systems requires the use of partitioning methods that can properly distribute the workload generated by agents among the existing distributed resources. In this paper, we analyze the use of irregular shape regions (convex hulls) for solving the partitioning problem. We have compared a partitioning method based on convex hulls with two techniques that use rectangular regions. The performance evaluation results show that the conv…

A more efficient method for clustering sheet metal shapes

2007

The nesting of two-dimensional irregular shapes is a common problem which is frequently encountered by a number of industries where raw material has to be, as economically as possible, cut from a given stock sheet. A frequently recurring problem as far as cutting stock is concerned, is how to obtain the best nesting of some pieces of flat patterns which occupy minimalarea convex enclosure. The area of convex enclosure is related to the convex hull of the union of patterns which can be imagined as a large rubber band surrounding the set of all polygons. Our goal is to automatically obtain the smallest area convex shape containing all the patterns. As a matter of fact, Cheng and Rao have prop…

Comparison of different cooperation strategies in the prey-predator problem

2006

The paper describes two cooperating strategies among several homogeneous agents to reach a given target. In our case we used the prey-predators paradigm in which a set of agents (predators) have the purpose to reach a target (prey). The problem is addressed as an optimization problem that has been faced with two different algorithms (a genetic algorithm and a particle swam optimization algorithm). The two approaches are evaluated by using a simulator for each strategy and the results show that the strategies are very different in terms of prey-predator successes. Genetic algorithm can be used by the prey to solve at the best the problem to reach the lair, otherwise the Particle Swarm Optimi…

Alternatives to the traditional waste management: Food recovery for human non-profit organizations

2015

Food supply chains are affected by losses of products which become poorly attractive for the consumers as they get close to their expiration date, therefore remaining unsold on the shelves. Such situation is ethically depreciable considering that many undernourished people rely on non-profit organizations for their survival. Despite of this situation, food recovery through the supply chain is still scarcely practiced, and the potential benefits achievable are frequently ignored. The paper presents a mathematical model for the coordination of the supply chain operating a food recovery policy. The model determines the optimal time for withdrawing the products from the shelves and the quantity…