This paper discusses the theoretical and practical aspects of new methods for solving DEA problems under real-life geometrical uncertainty and probability uncertainty of sample data. The proposed minimax approach to solve problems with geometrical uncertainty of sample data involves an...

This paper presents an optimum solution of the economic dispatch (ED) problem without considering transmission losses using linear programming (LP). In the ED problem, several on-line units (generators) are available, and it is needed to determine the power to produce by each unit in order to...

In the transboundary water resources allocation issues, there has been so far very limited progress made in terms of allocation techniques. This study introduces a composite water resources allocation approach that integrates both game theory and Pareto frontier technique over the case of the...

In facility layout problems, a major concern is the optimal design or remodeling of the facilities of an organization. The decision maker's objective is to arrange the facility in an optimal way, so that the interaction among functions (i.e. machines, inventories, persons) and places (i.e....

This paper by using Long-range Energy Alternatives Planning System (LEAP) constructs four different renewable energy scenarios for the Greek transport, energy, and industry sectors. By projecting the demand for renewable energy and the associated resulting carbon dioxide emissions up to the...

Combinatorial auctions permitting bids on bundles of items have been developed to remedy the exposure problem associated with single-item auctions. Given winning bundle prices a set of item prices is called market clearing or equilibrium if all the winning bids are greater than or equal and if...

The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is...

The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not...