Euclidean centers: Computation, properties and a MOLP application

The question of centers addresses the issue of how to inscribe an object within a region defined by a set of constraints. More than one centering approach can be defined which leads to a different inscribed object and a different derivation procedure for both the object as well as its center. When a...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical and computer modelling Vol. 48; no. 1; pp. 197 - 205
Main Authors: Arbel, Ami, Vargas, Luis G.
Format: Journal Article
Language:English
Published: Oxford Elsevier Ltd 01.07.2008
Elsevier Science
Subjects:
Convex and discrete geometry
Euclidean centers
Exact sciences and technology
Geometry
Linear programming
Mathematical analysis
Mathematics
Methods of scientific computing (including symbolic computation, algebraic computation)
Multiple-objective linear programming (MOLP)
Numerical analysis. Scientific computation
Sciences and techniques of general use
Linear programming
Multiple-objective linear programming (MOLP)
Euclidean centers
Polytope
Sphere
Scientific computation
Applied mathematics
Mathematical model
Computer aided analysis
ISSN:0895-7177, 1872-9479
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The question of centers addresses the issue of how to inscribe an object within a region defined by a set of constraints. More than one centering approach can be defined which leads to a different inscribed object and a different derivation procedure for both the object as well as its center. When attempting to inscribe the largest sphere within the constraints polytope the problem is defined as one of finding the Euclidean center of that polytope. We address in this paper various issues associated with the derivation of the Euclidean center and illustrate one application of this center to multiple-objective linear programming (MOLP) problems.
ISSN:0895-7177
1872-9479
DOI:10.1016/j.mcm.2007.07.009