Insitutional Repository at the National Graduate Institute for Policy Studies
Insitutional Repository at the National Graduate Institute for Policy StudiesNot a member yet
1035 research outputs found
Sort by
A Personal Perspective on Operations Research
In this presentation, I will try to sketch the present status of Operations Research and Management Science which I have gleaned from my own experience. It is said in Japan that OR/MS was an excellent tool for managers up to the early 70's, but that in recent years it has not been utilized so widely. In addition, there seems to be a big gap between academics and business circles regarding the use of OR/MS and the gap is becoming bigger. Many people see this gap as a crisis for OR/MS.
Firstly, I will explain several causes of this gap, emphasizing the importance of tight cooperation between models, algorithms and applications which, I think, constitute a kind of troika in OR/MS. Then I will briefly survey models, algorithms and applications of OR/MS. Finally, after emphasizing the role of optimization, I will talk about my personal view on the future development of OR/MS.A Plenary Speech at the Third Conference of the Association of APORS (Asian-Pacific Operational Research Societies within IFORS) on July 26th, 1994, Fukuoka, Japan.departmental bulletin pape
An Observation on the Cone-Ratio Model in Data Envelopment Analysis
In this paper, we will discuss subjects related to virtual multipliers in the cone-ratio model in DEA. Usually, there exists ambiguity in the virtual multipliers in the polyhedral cone-ratio method when some exemplary efficient DMUs' multipliers are employed as the admissible directions of the cone. Firstly, we will show a convex cell subdivision of the multiplier simplex. Then, three practical methods for resolving this ambiguity will be presented with an example.departmental bulletin pape
Some Computational Issues in Data Envelopment Analysis
This paper reflects the author's experiences in developing various DEA software, including models such as CCR, BCC, general returns to scale, categorical inputs and outputs and different systems. All the software deals with the dual side of the original CCR model and no non-Archimedian small number is used.departmental bulletin pape
A Note on Group vs. Individual Decision Making in the Analytic Hierarchy Process
When we estimate the relative distance between cities or the relative area of figures by the Analytic Hierarchy Process (AHP), it is often observed that a group decision usually outperforms an individual one. This paper addresses this phenomena and shows that the accuracy of estimates is improved in approximate proportion to the square root of the number of individuals in the group.departmental bulletin pape
A Logarithmic Least Squares Method for Incomplete Pairwise Comparisons in the Analytic Hierarchy Process
This paper describes a logarithmic least squares method or a geometric mean method for estimating the relative weight of alternatives when some entries of the pairwise comparisons matrix are missing.departmental bulletin pape
DEA事例集 '92
[目次]まえがきDEAとはDEA事例(1) 世界の主要航空会社の国際線輸送実績の比較 山地哲也、増田文之(2) 金融機関の効率性と危険度合い(都銀と上位地銀) 松家真一(3) 自民党支持と予算配分 金森禎士(4)サラリーマンの所得効率の評価について 福井琴樹(5) 主要国における研究費等の効率性 阿蘇品圭之(6) 埼玉のビジネス・ポテンシャル ‐製造業の効率性の分析- 川上純、畑正夫、山本康成(7) プロ野球選手の効率について 前田洋一あとがきDEA事例研究一覧departmental bulletin pape
An ε-Free DEA : A New Measure of Efficiency
The purposes of this paper are (i) to present DEA (Data Envelopment Analysis) without using the non-Archimedian infinitesimal ε and (ii) to introduce a new measure of efficiency, which takes account of slacks in inputs and shortages in outputs and expresses the relative efficiency of decision making units more properly than the traditional one.departmental bulletin pape
AHP事例集 '92 (1)
[目次]まえがき 刀根薫AHPとはAHP事例(1) 地価税の成立過程の分析 岩田昭男、斉藤太香雄、福井琴樹(2) 外国人労働者受け入れ政策の決定 小出 賢三(3) 一般住宅建築工法の決定 P31西原健治(4) ソ連政府の政策展開の方向性の選択 松家真一(5)女性の働き方選択 平垣内潤子、横尾淑子(6) 死刑制度の存廃について 石林勇人(7) どの宗教が役に立つか 村上靖あとがきAHP事例研究一覧departmental bulletin pape
An Active-Set Strategy in Interior Point Method for Linear Programming
We will present a potential reduction method for linear programming where only the constraints with relatively small dual slacks -active constraints- will be taken into account to form the ellipsoid constraint at each iteration of the process. The algorithm converges to the optimal feasible solution in O( √nL) iterations with the same polynomial bound with the full constraints case, where n is the number of variables and L is the data length. If a small portion of the constraints is active near the optimal solution, the computational cost to find the next direction of movement in one iteration will be fairly reduced by the proposed strategy. As a special case of this strategy, we will show that the interior point method can be managed by the basis factorization techniques of the simplex method coupled with a sequence of rank-one changes to matrices.This research was partially done in June 1990 while the author was visiting Department of Mathematics, University of Pisa.departmental bulletin pape