Abstract: We consider a network design problem which has
shortest routing restriction based on the values determined by the
installed facilities on each arc. In conventional multicommodity
network design problem, a commodity can be routed through any
possible path when the capacity is available. But, we consider
a problem in which the commodity between two nodes must be
routed on a path which has shortest metric value and the link
metric value is determined by the installed facilities on the link.
By this routing restriction, the problem has a distinct characteristic.
We present an integer programming formulation containing the
primal-dual optimality conditions to the shortest path routing. We
give some computational results for the model.
Abstract: A DEA model can generally evaluate the performance
using multiple inputs and outputs for the same period. However, it is
hard to avoid the production lead time phenomenon some times, such
as long-term project or marketing activity. A couple of models have
been suggested to capture this time lag issue in the context of DEA.
This paper develops a dual-MPO model to deal with time lag effect in
evaluating efficiency. A numerical example is also given to show that
the proposed model can be used to get efficiency and reference set of
inefficient DMUs and to obtain projected target value of input
attributes for inefficient DMUs to be efficient.