In Folge der steigenden Nachfrage nach ethischen Kapitalanlagen stehen die Unternehmen vor der Herausforderung, neben den typischen monetären Zielen auch Umweltschutzziele in die Investitionsbewertung einbeziehen zu müssen. Bestehende Ansätze der Investitionsbewertung unter Berücksichtigung...

This work introduces a novel formulation of system optimal dynamic traffic assignment that captures strategic route choice in users under demand uncertainty. We define strategic route choice to be that users choose a path prior to knowing the true travel demand which will be experienced...

The concept “Data Envelopment Analysis” (DEA) was introduced in the journal literature by the highly influential 1978 paper of Charnes, Cooper, and Rhodes. In the subsequent literature the development of research leading up to this paper tended to be forgotten. However, studying this...

We introducea new computational framework for DEA that reduces computationtimes and increases flexibility in applications over multiplemodels and orientations.The process is based on the identificationof frames--minimal subsets of the data needed to describethe models in the problems--for each...

We provide a modeling framework for banks’ business planning under Basel III. For this purpose, we write banks’ planning as a formal optimization problem where Basel III minimum requirements/ratios enter as constraints. The linear program provides dual variables that are interpreted as...

The aim of this work is to measure the Industrial Marshallian District (IMD) effect through non-radial measures of technical efficiency. Taking as reference the spatial location of each firm (inside or outside of the IMD), a valuable information can be obtained to assess whether there exist...

We propose an entire space polynomial-time algorithm for linear programming. First, we give a class of penalty functions on entire space for linear programming by which the dual of a linear program of standard form can be converted into an unconstrained optimization problem. The relevant...

Recent studies on the kernel function-based primal-dual interior-point algorithms indicate that a kernel function not only represents a measure of the distance between the iteration and the central path, but also plays a critical role in improving the computational complexity of an...

New versions and extensions of Benson’s outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each iteration rather than two or three as in previous...