Journal of the Operations Research Society of Japan

[title in Japanese]

Article type: Cover
1997 Volume 40 Issue 2 Pages Cover4-
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.Cover4

JOURNAL FREE ACCESS

Download PDF (215K)
[title in Japanese]

Article type: Appendix
1997 Volume 40 Issue 2 Pages App3-
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.App3

JOURNAL FREE ACCESS

Download PDF (180K)
TWO-LAYER QUEUEING NETWORKS

Issei Kino

Article type: Article
1997 Volume 40 Issue 2 Pages 163-185
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.163

JOURNAL FREE ACCESS

Show abstractHide abstract

A family of queueing networks with a two-layer configuration is proposed and analyzed in order to provide well structured hierarchy of network models for performance analysis of computer and/or communication systems. The upper layer describes the often-disregarded software behavior while the lower layer describes the usual hardware behavior. For the case in which the upper layer includes no outstanding queues, a product form equilibrium joint distribution is established assuming state-dependent arrival and state-dependent service rate functions with general service time distributions. The marginal distributions are derived for convenience in applying the results. For the case in which the upper layer dose include outstanding queues, an approximation method is proposed, which generalizes the flow-equivalent methods.

View full abstract

Download PDF (1431K)
PRIVATIZATION OF JAPAN NATIONAL RAILWAYS : DEA TIME SERIES APPROACHES

Toshiyuki Sueyoshi, Hiroshi Machida, Manabu Sugiyama, Takeshi Arai, Yo ...

Article type: Article
1997 Volume 40 Issue 2 Pages 186-205
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.186

JOURNAL FREE ACCESS

Show abstractHide abstract

This research examines the privatization effects of Japan National Railways, using three different types of DEA time series approaches. This empirical study can identify that its privatization attains consider-able improvement in productivity, profit,ability and managerial efficiency, but failing cost efficiency. This empirical result can serve as a basis of corporate policy for cost reduction.

View full abstract

Download PDF (2206K)
A STOCHASTIC SEQUENTIAL ALLOCATION PROBLEM WHERE THE RESOURCES CAN BE REPLENISHED

Masahiro Sato

Article type: Article
1997 Volume 40 Issue 2 Pages 206-219
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.206

JOURNAL FREE ACCESS

Show abstractHide abstract

Suppose a hunter starts hunting over certain given t periods with i bullets in hand. A distribution of the value of each appearing target and the hitting probability of a bullet are known. For shooting, he takes a strategy of shoot-look-shoot scheme, implying that if a bullet just fired does not hit the target, then the hunter must decide whether or not to shoot an additional one. At the end of each period, it is allowed to replenish a given number of bullets by paying a certain cost. The objective here is to examine the properties of the optimal policy which maximizes the total expected net reward. We get the following main results: (1) the optimal policy for shooting is monotone in the number of bullets in hand if it is always optimal either to replenish a certain number of bullets every period or not to replenish them at all, (2) if only one bullet can be replenished per period, then both the optimal policies for shooting and replenishment are monotone in the number of bullets in hand, (3) if more than one can be replenished per period, then there exist examples where the optimal policies for shooting are not monotone in the number of remaining bullets.

View full abstract

Download PDF (940K)
DEA PRICING SYSTEM

Toshiyuki Sueyoshi

Article type: Article
1997 Volume 40 Issue 2 Pages 220-235
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.220

JOURNAL FREE ACCESS

Show abstractHide abstract

This research presents a new application of Data Envelopment Analysis (DEA) to empirically determine prices of multiple products. The DEA technique is now widely applied to performance analysis and efficiency measurement in economics, business and other areas in social science. This study does not explore such conventional DEA uses, rather directing towards a new DEA application to the determination of a marginal cost pricing system or a profit-based pricing system. Nonlinear properties of the new DEA approach are explored in this research.

View full abstract

Download PDF (1220K)
GROUP ANALYTIC HIERARCHY PROCESS BASED ON CONSENSUS MAKING MODEL

Yoshiyasu Yamada, Manabu Sugiyama, Naokazu Yamaki

Article type: Article
1997 Volume 40 Issue 2 Pages 236-244
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.236

JOURNAL FREE ACCESS

Show abstractHide abstract

This paper proposes a group consensus making method by using modified Analytic Hierarchy Process. We define this method "Group Analytic Hierarchy Process (GAHP)" GAHP can not only be used for supporting group member's consensus making for decisions, but also it may be useful for raising member's satisfaction for the decisions, because it has the structure which guides group members into their evaluation flexible and promotes the group's rational decision which we mean the most consistent decision in the sense of C.I. (Consistency Index) minimum. So, it will be used as the useful tool for group consensus making. Two main ways to determine a group pairwise comparison matrix is introduced in this method. One is to determine a group pairwise comparison matrix from group member's pairwise comparison matrices. The other is to determine the pairwise comparison matrix with point elements from the group pairwise comparison matrix with interval elements. And lastly, the paper shows a numerical example for helping readers of this paper understand the procedure of this method. GAHP will be anticipated for further applications to group consensus making.

View full abstract

Download PDF (791K)
A VARIANT OF THE OUTER APPROXIMATION METHOD FOR GLOBALLY MINIMIZING A CLASS OF COMPOSITE FUNCTIONS

Takahito Kuno

Article type: Article
1997 Volume 40 Issue 2 Pages 245-260
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.245

JOURNAL FREE ACCESS

Show abstractHide abstract

In this paper, we consider a constrained optimization problem whose objective function is a composition of two functions g : R^n → R^P and f : R^P → R^1. We show that a variant of the outer approximation method generates a globally e-minimum point of f o g = f(g(・)) over a convex set after finitely many iterations, if g is convex and f is continuous and coordinatewise increasing. Preliminary experiments indicate that the proposed algorithm is reasonably practical for two types of multiplicative programs if p is less than four.

View full abstract

Download PDF (1086K)
LEAST ABSOLUTE VALUE ESTIMATION

Toshiyuki Sueyoshi

Article type: Article
1997 Volume 40 Issue 2 Pages 261-275
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.261

JOURNAL FREE ACCESS

Show abstractHide abstract

This research first describes historical perspectives of Least Absolute Value (LAV) estimation, which has been long considered as an estimation alternative of conventional Least Squares (LS) regression. Then, this article explores statistical properties regarding the LAV estimation from Goal Programming (GP). Using a small illustrative example, this study presents new theoretical features regarding the LAV estimation. It is hoped that this research effort enhances its applicability to deal with many decisinal issues in reality.

View full abstract

Download PDF (1090K)
STRUCTURES OF SUBLATTICES RELATED TO VEINOTT RELATION

Takeshi Naitoh, Akira Nakayama

Article type: Article
1997 Volume 40 Issue 2 Pages 276-280
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.276

JOURNAL FREE ACCESS

Show abstractHide abstract

Let E be a nonempty finite set. H. Narayanan showed a theorem describing that the family {II'| II' ∈ P_E, Σ_<X∈II'> f(X) = min_<II'∈P_E> Σ_<X∈II> f(X)} forms a lattice, where f is a submodular function on 2^E and P_E is the set of all partitions of E. On the other hand, L. S. Shapley gave a theorem on a necessary and sufficient condition for a convex game to be decomposable. We give a theorem which is a generalization of these two theorems.

View full abstract

Download PDF (359K)
[title in Japanese]

Article type: Appendix
1997 Volume 40 Issue 2 Pages 281-282
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.281

JOURNAL FREE ACCESS

Download PDF (117K)
[title in Japanese]

Article type: Appendix
1997 Volume 40 Issue 2 Pages App4-
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.App4

JOURNAL FREE ACCESS

Download PDF (195K)
[title in Japanese]

Article type: Cover
1997 Volume 40 Issue 2 Pages Cover5-
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.Cover5

JOURNAL FREE ACCESS

Download PDF (109K)
[title in Japanese]

Article type: Cover
1997 Volume 40 Issue 2 Pages Cover6-
Published: 1997
Released on J-STAGE: June 27, 2017

DOIhttps://doi.org/10.15807/jorsj.40.Cover6

JOURNAL FREE ACCESS

Download PDF (109K)

Register with J-STAGE for free!