The linearized version of an algorithm for the mixed norms problem

DOI10.1016/0377-0427(89)90336-1zbMath0698.65037OpenAlexW2078772764MaRDI QIDQ912569

Ryszard Klempous, Jerzy Kotowski, Mieczyslaw Kuliszewski

Publication date: 1989

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(89)90336-1

zbMATH Keywords

Fermat-Weber's problemgeneralized Fermat's probleminner linearization techniquemixed norms optimization problemoptimal planning processSteiner-Weber's problemWeber's problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Production theory, theory of the firm (91B38)

Related Items (1)

A projected Weiszfeld algorithm for the box-constrained Weber location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Efficient Algorithm for the Solution of the Weber Problem with Mixed Norms
• A Duality Theorem for Nonlinear Programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
• The Transportation-Location Problem

This page was built for publication: The linearized version of an algorithm for the mixed norms problem