Now showing items 1-4 of 4
Optimal location and design of a competitive facility [Article]
A single facility has to be located in competition with fixed existing facilities of similar type. Demand is supposed to be concentrated at a finite number of points, and consumers patronise the facility to which they are ...
Generalized goal programming: polynomial methods and applications [Article]
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations with respect to targets. In particular, ...
Some relations between variational-like inequalities and efficient solutions of certain nonsmooth optimization problems [Article]
We study the equivalence between the solutions of the variational-like inequality problem and the solutions of certain nonsmooth and nonconvex vectorial optimization problem.
Solving nonconvex planar location problems by nite dominating sets [Article]
It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by nding a fi nite dominating set, i.e. a finite set of candidates guaranteed to contain at least one ...