• 대한수학회보
• /
• 제37권3호
• /
• pp.633-639
• /
• 2000

Let $A=(a_{ij}\ and\ B=(b_{ij}\ be\ n\times\ n$ complex matrices and let A$\bigcirc$B denote the Hadamard product of A and B, that is $AA\circB=(A_{ij{b_{ij})$.We conjecture a permanental analog of Oppenheim's inequality and verify it for n=2 and 3 as well as for some infinite classes of matrices.

• 대한수학회지
• /
• 제36권5호
• /
• pp.1009-1020
• /
• 1999

The minimum permanent and the set of minimizing matrices over the face of the polytope n of all doubly stochastic matrices of order n determined by any staircase matrix was determined in [4] in terms of some parameter called frame. A staircase matrix can be described very simply as a Ferrers matrix by its row sum vector. In this paper, some simple exposition of the permanent minimization problem over the faces determined by Ferrers matrices of the polytope of n are presented in terms of row sum vectors along with simple proofs.

• 대한수학회지
• /
• 제35권2호
• /
• pp.423-432
• /
• 1998

Let p, q be integers such that 2 $\leq$ p, q $\leq$ n, and let $D_{p, q}$ denote the matrix obtained from $I_{n}$, the identity matrix of order n, by replacing each of the first p columns by an all 1's vector and by replacing each of the first two rows and each of the last q-2 rows by an all 1's vector. In this paper the permanent minimization problem over the face, determined by the matrix $D_{p, q}$, of the polytope of all n $\times$ n doubly stochastic matrices is treated.d.

• 대한수학회보
• /
• 제33권1호
• /
• pp.127-133
• /
• 1996

Let $\Omega_n$ be the polyhedron of $n \times n$ doubly stochastic matrices, that is, nonnegative matrices whose row and column sums are all equal to 1. The permanent of a $n \times n$ matrix $A = [a_{ij}]$ is defined by $$ per(A) = \sum_{\sigma}^ a_{1\sigma(a)} \cdots a_{n\sigma(n)} $$ where $\sigma$ runs over all permutations of ${1, 2, \ldots, n}$.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.250-278
• /
• 2004

The product rate variation problem, to be called the PRVP, is to sequence different type units that minimizes the maximum value of a deviation function between ideal and actual rates. The PRVP is an important scheduling problem that arises on mixed-model assembly lines. A surge of research has examined very interesting methods for the PRVP. We believe, however, that several issues are still open with respect to this problem. In this study, we consider convex bipartite graphs, perfect matchings, permanents and balanced sequences. The ultimate objective of this study is to show that we can provide a more efficient and in-depth procedure with a graph theoretic approach in order to solve the PRVP. To achieve this goal, we propose formal alternative proofs for some of the results stated in the previous studies, and establish several new results.