Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
Journal Title: Decision Making in Manufacturing and Services - Year 2007, Vol 1, Issue 1
Abstract
Decision making with multiple criteria requires preferences elicited from the decision maker to determine a solution set. Models of preferences, that follow upon the concept of nondominated solutions introduced by Yu (1974), are presented and compared within a unified framework of cones. Polyhedral and nonpolyhedral, convex and nonconvex, translated, and variable cones are used to model different types of preferences. Common mathematical properties of the preferences are discussed. The impact of using these preferences in decision making is emphasized.
Authors and Affiliations
Margaret M. Wiecek
Keywords
Related Articles
- EP ID EP422900
- DOI 10.7494/dmms.2007.1.2.153
- Views 105
- Downloads 0
Corrigendum to ”Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs”
Amendment to Decision Making in Manufacturing and Services, vol. 5 (1–2), 2011, pp. 49–56
On Public Values and Power Indices
In this paper we analyze, from a different point of view, some values and power indices well defined in the social context where the goods are public. In particular we consider the Public Good index (Holler, 1982), the P...
Very Fast Non-Dominated Sorting
New and very ecient parallel algorithm for the Fast Non-dominated Sorting of Pareto fronts is proposed. By decreasing its computational complexity, the application of the proposed method allows us to increase the speedup...
Scheduling with High Variety of Customized Compound Products
Domestic appliance is an instance of manufacturing various products on clients demand with frequent changes of production. Although the technological process for each individual product is relatively simply, the variety...
Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling
The paper presents the resource-constrained project scheduling problem with the makespan minimisation criterion. To solve the problem, the authors propose insertion algorithms which generate schedules with use of forward...