On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem

In this paper a comparison is made between two decomposition techniques to solve a staff scheduling problem with column generation. In the first approach, decomposition takes place on the staff members, whereas in the second approach decomposition takes place on the activities that have to be performed by the staff members. The resulting master LP is respectively a set partitioning problem and a capacitated multi-commodity flow problem. Both approaches have been implemented in a branch-and-price algorithm. We show a trade-off between modeling power and computation times of both techniques.     

Decomposition of search for -structures in DAGs

We show that the problem of searching for v-structures in a directed acyclic graph can be decomposed into searches in its decomposed subgraphs. This result simplifies the search for v-structures and the recovery of local causal relationships.     

Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs

Robinson has proposed the bundle-based decomposition algorithm to solve a class of structured large-scale convex optimization problems. In this method, the original problem is transformed (by dualization) to an unconstrained nonsmooth concave optimization problem which is in turn solved by using a modified bundle method. In this paper, we give a posteriori error estimates on the approximate primal optimal solution and on the duality gap. We describe implementation and present computational experience with a special case of this class of problems, namely, block-angular linear programming problems. We observe that the method is efficient in obtaining the approximate optimal solution and compares favorably with MINOS and an advanced implementation of the Dantzig—Wolfe decomposition method.     

积格上蕴涵算子的直积分解

进一步讨论蕴涵算子的直积分解,描述积格上可以分解为两个蕴涵算子直积的蕴涵算子的特性,并研究积格上S-蕴涵、R-蕴涵、n-反演R-蕴涵和n-反演QL-蕴涵的可分解性。     

带调速器的多台机组的暂态关联稳定性

对于带调速器的多台电机组,本文引入关联矩阵E=(e_(ij))_(n×n),应用李雅普诺夫函数分解法,研究了此电力大系统的暂态关联稳定性,得到了系统的分解系数与稳定区域的估计公式。     

Decompositions of Besov–Morrey spaces and Triebel–Lizorkin–Morrey spaces

The aim of this paper is to define the Besov–Morrey spaces and the Triebel– Lizorkin–Morrey spaces and to present a decomposition of functions belonging to these spaces. Our results contain an answer to the conjecture proposed by Mazzucato. The first author is supported by Research Fellowships of the Japan Society for the Promotion of Science for Young Scientists. The second author is supported by Fūjyukai foundation and the 21st century COE program at Graduate School of Mathematical Sciences, the University of Tokyo.     

A New Decomposition Technique in Solving Multistage Stochastic Linear Programs by Infeasible Interior Point Methods

Multistage stochastic linear programming (MSLP) is a powerful tool for making decisions under uncertainty. A deterministic equivalent problem of MSLP is a large-scale linear program with nonanticipativity constraints. Recently developed infeasible interior point methods are used to solve the resulting linear program. Technical problems arising from this approach include rank reduction and computation of search directions. The sparsity of the nonanticipativity constraints and the special structure of the problem are exploited by the interior point method. Preliminary numerical results are reported. The study shows that, by combining the infeasible interior point methods and specific decomposition techniques, it is possible to greatly improve the computability of multistage stochastic linear programs.     

增广Lagrangian对偶分解方法求解变分不等式系统

本文考虑带约束的变分不等式系统.提出一个基于增广Lagrangian对偶的分解算法,本文给出了算法的收敛性分析.     

2-D/3-D finite-element solution of the steady Euler equations for transonic lifting flow by stream vector correction

In this paper we study the validation of the new formulation (potential-stream vector) of the steady Euler equations in 2-D/3-D transonic lifting regime flow. This approach, which is based on the Helmholtz decomposition of a velocity vector field, is designed to extend the potential approximation of Euler equations for severe situations such as high transonic or rotational subsonic flows. Different results computed by a fixed point algorithm on the stream vector correction are shown and discussed by comparing them with those obtained by the full potential approach.     

Analytic and approximate solutions of the space- and time-fractional telegraph equations

The Adomian decomposition method is used to obtain analytic and approximate solutions of the space-and time-fractional telegraph equations. The space- and time-fractional derivatives are considered in the Caputo sense. The analytic solutions are calculated in the form of series with easily computable terms. Some examples are given. The results reveal that the Adomian method is very effective and convenient.