Limit Gaussian Behavior of the Solutions of the Multidimensional Burger'; Equation with Weak-Dependent Initial Conditions

Asymptotic normality of the solutions of the initial-value problems for multidimensional Burgers' equation with weakly dependent possible non-Gaussian initial condition is proved.     

Convex composite multi-objective nonsmooth programming

This paper examines nonsmooth constrained multi-objective optimization problems where the objective function and the constraints are compositions of convex functions, and locally Lipschitz and Gâteaux differentiable functions. Lagrangian necessary conditions, and new sufficient optimality conditions for efficient and properly efficient solutions are presented. Multi-objective duality results are given for convex composite problems which are not necessarily convex programming problems. Applications of the results to new and some special classes of nonlinear programming problems are discussed. A scalarization result and a characterization of the set of all properly efficient solutions for convex composite problems are also discussed under appropriate conditions.This research was partially supported by the Australian Research Council grant A68930162.This author wishes to acknowledge the financial support of the Australian Research Council.     

Reduction of delayed optimal control problems to nondelayed problems

A method is exhibited which transforms a large class of optimal control problems with fixed delays to nondelayed problems, thus permitting classical results to be used in their analysis.     

Nondifferentiable mathematical programming and convex-concave functions

For a convex-concave functionL(x, y), we define the functionf(x) which is obtained by maximizingL with respect toy over a specified set. The minimization problem with objective functionf is considered. We derive necessary conditions of optimality for this problem. Based upon these necessary conditions, we define its dual problem. Furthermore, a duality theorem and a converse duality theorem are obtained. It is made clear that these results are extensions of those derived in studies on a class of nondifferentiable mathematical programming problems.This work was supported by the Japan Society for the Promotion of Sciences.     

Nonconical optimality conditions: Some additional results

The purpose of the present note is to provide a somewhat more flexible statement of the sufficiency conditions in Section 4 of Ref. 1 and to give explicit statements of the fundamental necessity and sufficiency results, which were only implicitly presented there. The additional flexibility is obtained by considering local, rather than global, pseudoconcavity requirements.     

Self-similar solutions of the porous medium equation in a half-space with a nonlinear boundary condition: existence and symmetry

We find existence of a nonnegative compactly supported solution of the problem Δu=u^α in , ∂u/∂ν=u on . Moreover, we prove that every nonnegative solution with finite energy is compactly supported and radially symmetric in the tangential variables.     

Blowup behaviors for diffusion system coupled through nonlinear boundary conditions in a half space

This paper deals with the blowup estimates near the blowup time for the system of heat equations in a half space coupled through nonlinear boundary conditions. The upper and lower bounds of blowup rate are established. The uniqueness and nonunique-ness results for the system with vanishing initial value are given.     

A MIP approach for some practical packing problems: Balancing constraints and tetris-like items

This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is quite frequent in space engineering and a real-world application deals with the Automated Transfer Vehicle project (funded by the European Space Agency), at present under development. A Mixed Integer Programming (MIP) approach is proposed. The three-dimensional single bin packing problem is considered. It consists of orthogonally placing, with possibility of rotation, the maximum number of parallelepipeds into a given parallelepiped. A MIP formulation of the problem is reported together with a MIP-based heuristic approach. Balancing conditions are furthermore examined, as well as the orthogonal placement (with rotation) of tetris-like items into a rectangular domain.Received: September 2003, Revised: February 2004, AMS classification: 90B99, 05B40, 90C90, 90C59Thanks are due to T. A. Ciriani for the important suggestions given for the whole paper and to S. Gliozzi (IBM, Business Consulting Services) for the significant support offered, in particular in discussing the topics presented in Sect. 2.1.