Determination of efficient points in multiple-objective location problems

DOI10.1002/1520-6750(198812)35:6%3C697::AID-NAV3220350613%3E3.0.CO;2-8MaRDI QIDQ3815098zbMATH OpenOpenAlexFDO

Authors B. Pelegrin, Francisco Ramón Fernández García

Publication date 1988

Full work available at URL https://doi.org/10.1002/1520-6750(198812)35:6%3C697::aid-nav3220350613%3E3.0.co;2-8

zbMATH Keywords

efficient pointslocational analysismultiple-objective location problemspolyhedral norm

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Management decision making, including multiple objectives (90B50)

Recommendations

• Determination of efficient solutions for point-objective locational decision problems
• El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
• Efficient solutions of multicriteria location problems with rectilinear norm
• A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
• Sets of efficient points in a normed space

Cited in

(24)

• Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
• A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
• Efficiency in constrained continuous location
• Bicriteria and restricted 2-facility Weber problems
• Multiobjective control approximation problems: duality and optimality.
• A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
• A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
• Multiobjective solution of the uncapacitated plant location problem
• Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
• On the multisource hyperplanes location problem to fitting set of points
• Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
• Multiobjective analysis of facility location decisions
• Pareto envelopes in simple polygons
• El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
• An efficient method for calculating the minimum distance from an operating point to a specific (hyperbolic) efficient frontier
• Relationships between constrained and unconstrained multi-objective optimization and application in location theory
• scientific article; zbMATH DE number 4035594 (Why is no real title available?)
• scientific article; zbMATH DE number 1076403 (Why is no real title available?)
• Multiple objective programming with piecewise linear functions
• scientific article; zbMATH DE number 1910410 (Why is no real title available?)
• scientific article; zbMATH DE number 1417899 (Why is no real title available?)
• Hamilton-Jacobi scaling limits of Pareto peeling in 2D
• Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study
• Determination of efficient solutions for point-objective locational decision problems

This page was built for publication: Determination of efficient points in multiple-objective location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815098)