Computing compromise sets in polyhedral framework

Impacto

Downloads

Downloads per month over past year

View download statistics for this eprint

Altmetric

>> Ir a Scopus

Buscar en Google Scholar™

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

PDF
Restringido a Repository staff only
296kB

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

Publisher

==>>> 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
Deposited On:	30 May 2012 07:34
Last Modified:	12 Dec 2018 15:13

Origin of downloads

Repository Staff Only: item control page