All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 38 of 38

Showing per page

The optimization of heat radiation intensity

Mlýnek, Jaroslav, Srb, Radek (2013)

Programs and Algorithms of Numerical Mathematics

This article focuses on the problem of calculating the intensity of heat radiation and its optimization across the surface of an aluminium or nickel mould. The inner mould surface is sprinkled with a special PVC powder and the outer mould surface is warmed by infrared heaters located above the mould. In this way artificial leathers are produced in the car industry (e.g., the artificial leather on a car dashboard). The article includes a description of how a mathematical model allows us to calculate the...

The problem of data assimilation for soil water movement

François-Xavier Le Dimet, Victor Petrovich Shutyaev, Jiafeng Wang, Mu Mu (2004)

ESAIM: Control, Optimisation and Calculus of Variations

The soil water movement model governed by the initial-boundary value problem for a quasilinear 1-D parabolic equation with nonlinear coefficients is considered. The generalized statement of the problem is formulated. The solvability of the problem is proved in a certain class of functional spaces. The data assimilation problem for this model is analysed. The numerical results are presented.

The problem of data assimilation for soil water movement

François-Xavier Le Dimet, Victor Petrovich Shutyaev, Jiafeng Wang, Mu Mu (2010)

ESAIM: Control, Optimisation and Calculus of Variations

The soil water movement model governed by the initial-boundary value problem for a quasilinear 1-D parabolic equation with nonlinear coefficients is considered. The generalized statement of the problem is formulated. The solvability of the problem is proved in a certain class of functional spaces. The data assimilation problem for this model is analysed. The numerical results are presented.

The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up

Kjetil K. Haugen, Asmund Olstad, Krystsina Bakhrankova, Erik Van Eikenhorst (2010)

Kybernetika

This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.

The smooth continuation method in optimal control with an application to quantum systems

Bernard Bonnard, Nataliya Shcherbakova, Dominique Sugny (2011)

ESAIM: Control, Optimisation and Calculus of Variations

The motivation of this article is double. First of all we provide a geometrical framework to the application of the smooth continuation method in optimal control, where the concept of conjugate points is related to the convergence of the method. In particular, it can be applied to the analysis of the global optimality properties of the geodesic flows of a family of Riemannian metrics. Secondly, this study is used to complete the analysis of two-level dissipative quantum systems, where the system...

The smooth continuation method in optimal control with an application to quantum systems

Bernard Bonnard, Nataliya Shcherbakova, Dominique Sugny (2011)

ESAIM: Control, Optimisation and Calculus of Variations

The motivation of this article is double. First of all we provide a geometrical framework to the application of the smooth continuation method in optimal control, where the concept of conjugate points is related to the convergence of the method. In particular, it can be applied to the analysis of the global optimality properties of the geodesic flows of a family of Riemannian metrics. Secondly, this study is used to complete the analysis of two-level dissipative quantum systems, where the system...

The SQP method for control constrained optimal control of the Burgers equation

Fredi Tröltzsch, Stefan Volkwein (2001)

ESAIM: Control, Optimisation and Calculus of Variations

A Lagrange–Newton–SQP method is analyzed for the optimal control of the Burgers equation. Distributed controls are given, which are restricted by pointwise lower and upper bounds. The convergence of the method is proved in appropriate Banach spaces. This proof is based on a weak second-order sufficient optimality condition and the theory of Newton methods for generalized equations in Banach spaces. For the numerical realization a primal-dual active set strategy is applied. Numerical examples are...

The SQP method for control constrained optimal control of the Burgers equation

Fredi Tröltzsch, Stefan Volkwein (2010)

ESAIM: Control, Optimisation and Calculus of Variations

A Lagrange–Newton–SQP method is analyzed for the optimal control of the Burgers equation. Distributed controls are given, which are restricted by pointwise lower and upper bounds. The convergence of the method is proved in appropriate Banach spaces. This proof is based on a weak second-order sufficient optimality condition and the theory of Newton methods for generalized equations in Banach spaces. For the numerical realization a primal-dual active set strategy is applied. Numerical examples are...

Three tabu search methods for the MI-FAP applied to 802.11 networks

Sacha Varone, Nicolas Zufferey (2008)

RAIRO - Operations Research - Recherche Opérationnelle

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...

Three tabu search methods for the MI-FAP applied to 802.11 networks

Sacha Varone, Nicolas Zufferey (2009)

RAIRO - Operations Research

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...

Currently displaying 21 – 38 of 38

Previous Page 2