Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Yukihiro Maruyama"'
Publikováno v:
Omega. 89:21-39
We propose a profit ratio (the ratio of revenue to expenses) change index, which can be applied to panel data to measure productivity growth and suitable for situations when producers desire to maximize revenue and minimize expenses simultaneously. T
Publikováno v:
China-USA Business Review. 19
Autor:
Yukihiro Maruyama
Publikováno v:
Journal of the Operations Research Society of Japan. 60:136-155
Autor:
Yukihiro Maruyama1 maruyama@net.nagasaki-u.ac.jp
Publikováno v:
Optimization Methods & Software. Aug2003, Vol. 18 Issue 4, p475. 15p.
Autor:
Yukihiro Maruyama
Publikováno v:
Asia-Pacific Journal of Operational Research. 24:181-202
In this paper, we will introduce a new subclass of bitone sequential decision process (bsdp) and give a representation theorem for the subclass called positively/negatively bsdp, shortly, p/n bsdp, that is, necessary and sufficient condition for p/n
Autor:
Yukihiro Maruyama
Publikováno v:
Optimization. 48:137-155
In this we study a wide class of optimal path problem in acyclic digraphs, where path lengths are defined through associative binary operations:addition, multiplication, multiplication-addition, fraction and so on. Solving a system of two interrelate
Autor:
Yukihiro Maruyama
Publikováno v:
Bulletin of informatics and cybernetics. 31:147-163
In the paper we consider a wide class of shortest path problems where the length of a path is defined through various associative binary operations. Solving a system of two interrelated recursive equations, we simultaneously find both shortest and lo
Autor:
Yukihiro Maruyama
Publikováno v:
Bulletin of informatics and cybernetics. 29:67-81
We consider a wide class of shortest path problems in acyclic digraphs. In the problems, the length of a path is defined by using an associative binary operation. We derive recursive equations in dynamic programming for the problems, which involve ad
Autor:
Yukihiro Maruyama
Publikováno v:
Optimization. 38:287-299
This paper considers a wide class of shortest path problems in acyclic digraphs, where path lengths are given by the multiplicatively additive value. The problems are solved through bynamic programming, [4]. The bynamic programming formulation for th
Publikováno v:
AIP Conference Proceedings.
In this paper, we propose a range adjusted measure network data envelopment analysis (DEA) model that can deal with the overall efficiencies as well as divisional ones in a unified framework. We show some properties of this model.