Discrete, linear approximation problems in polyhedral norms

SummaryWe introduce a class of polyhedral norms and study discrete linear approximation problems under these norms. It is possible to give a uniform treatment, in particular, ofL1 and maximum norm problems, at least as regards notation; and we develop a general exchange algorithm in which we permit also linear inequality constraints.