巻号一覧
36 巻 (1993)
- 4 号 p. 199-
- 3 号 p. 121-
- 2 号 p. 65-
- 1 号 p. 1-
36 巻, 1 号
選択された号の論文の10件中1～10を表示しています
- |<
- <
- 1
- >
- >|
-
原稿種別: 表紙
1993 年 36 巻 1 号 p. Cover1-
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (139K) -
原稿種別: 付録等
1993 年 36 巻 1 号 p. App1-
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (154K) -
Tatsuro Wakahara, Masao Fukushima, Toshihide Ibaraki原稿種別: Article
1993 年 36 巻 1 号 p. 1-12
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーNonlinear programming problems often contain two types of variables; one appears linearly, while the other nonlinearly. The purpose of this paper is to propose a practical decomposition approach for solving nonlinear programming problems in which the number of linear variables is presumably much larger than that of nonlinear variables. Using quadratic penalty and quadratic perturbation techniques, we first, formulate a parametric. approximate problem for the given problem. By reformulating the approximate problem, we then obtain a differentiable nonlinear programming problem containing the nonlinear variables only. The main advantage of this approach is that, any available nonlinear programming code maybe used to solve the last problem, of which variables are presumably much fewer than the original problem. We may thus avoid solving the given problem directly or developing a specialized algorithm like Benders' algorithm that, essentially deals with a nonsmooth optimization problem equivalent, to the original problem. We give error bounds for the approximate problem and mention a possibility of parallel decomposition for a class of structured problems. Some computational results indicate that, the proposed approach is practically useful.抄録全体を表示PDF形式でダウンロード (837K) -
Fumiaki Machihara原稿種別: Article
1993 年 36 巻 1 号 p. 13-28
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーAnalysis of the completion time of a service unit with PH-Markov renewal preemptions are presented for several preemptive disciplines. Applying the results of these analysis and the theory of queues with semi-Markov service times, a PH-MR, M/G_1 , G_2/1 queue is analyzed and the effect of preemptions is discussed. A non-preemptive queue is also analyzed.抄録全体を表示PDF形式でダウンロード (899K) -
Toshiaki Tsuchiya, Yoshitaka Takahashi原稿種別: Article
1993 年 36 巻 1 号 p. 29-45
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーThis paper investigates a discrete-time system with Markov modulated batch Bernoulli process (MMBP) inputs, general service times, and a finite capacity waiting room (queue). The FIFO and space priority service rules are considered. The main motivation for studying this type of queue is its potential applicability to time-slotted communication systems in broadband ISDN (B-ISDN). Applying the supplementary variable technique and the matrix analysis approach, we obtain the steady-state distributions of the number of customers in the system as well as loss probabilities under individual service rules.抄録全体を表示PDF形式でダウンロード (1062K) -
Sigeiti Moriguti原稿種別: Article
1993 年 36 巻 1 号 p. 46-61
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーSuppose there are n objects in a row and we want to choose as good an object as possible. We are allowed to observe one by one starting at an end. We may stop at any point and take the object there, but going back is not allowed. The stopping rule is based on the relative rank of the object among those observed so far. The cost of observation, k, is considered to be either zero or positive. This paper presents a basic theory on this problem as well as a set of algorithms which give the optimum stopping rule for given n and k, and the characteristics of the rule.抄録全体を表示PDF形式でダウンロード (847K) -
原稿種別: 付録等
1993 年 36 巻 1 号 p. 62-63
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (111K) -
原稿種別: 付録等
1993 年 36 巻 1 号 p. App2-
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (188K) -
原稿種別: 表紙
1993 年 36 巻 1 号 p. Cover2-
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (83K) -
原稿種別: 表紙
1993 年 36 巻 1 号 p. Cover3-
発行日: 1993年
公開日: 2017/06/27
ジャーナル フリーPDF形式でダウンロード (83K)
- |<
- <
- 1
- >
- >|