Complutense University Library

Computing compromise sets in polyhedral framework

Blasco Contreras, Fernando and Cuchillo Ibáñez, Eduardo and Morón, Manuel A. and Romero López, Carlos (2000) Computing compromise sets in polyhedral framework. Applied Mathematics Letters, 13 (5). pp. 93-98. ISSN 0893-9659

[img] PDF
Restricted to Repository staff only until 31 December 2020.

296kB

Official URL: http://www.sciencedirect.com/science/article/pii/S0893965900000392

View download statistics for this eprint

==>>> Export to other formats

Abstract

In this note, we describe the compromise set for a special polyhedral convex feasible set. This procedure gives the monotonicity of the compromise set. This scenario appears in some engineering and economic applications like the determination of the consumer's equilibrium.


Item Type:Article
Uncontrolled Keywords:Compromise programming; compromise set; convexity; monotonicity; p-norms
Subjects:Sciences > Mathematics > Set theory
Sciences > Mathematics > Topology
ID Code:15427
References:

F. Blasco, E. Cuchillo-Ibañez, M.A. Morón and C. Romero, On the monotonicity of the compromise set in multicriteria problems, J. Optim. Theory Appl. 102, 69-82, (1999).

P.L. Yu, Multiple-Criteria Decision Making: Concepts, Techniques and Extensions, Plenum Press, New York, (1985).

E. Ballestero and C. Romero, Multiple Criteria Decision Making and its Applications to Economic Problems, Kluwer Academic, Boston, MA, (1998).

M. Freimer and P.L. Yu, Some new results on compromise solutions for group decision problems, Management Science 23, 688-693, (1976).

Deposited On:30 May 2012 07:34
Last Modified:06 Feb 2014 10:24

Repository Staff Only: item control page