TITLE

Convex Location Problems on Tree Networks

AUTHOR(S)
Dearing, P. M.; Francis, R. L.; Lowe, T. J.
PUB. DATE
July 1976
SOURCE
Operations Research;Jul/Aug76, Vol. 24 Issue 4, p628
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper studies problems of finding optimal facility locations on an imbedding of a finite, undirected network having positive arc lengths. We establish that a large class of such problems is convex, in a well defined sense, for all choices of the data if and only if the network is a tree. A number of useful properties of related convex functions and convex sets are identified.
ACCESSION #
5427885

 

Related Articles

  • An outcome space approach for generalized convex multiplicative programs. Oliveira, R�bia M.; Ferreira, Paulo A. V. // Journal of Global Optimization;May2010, Vol. 47 Issue 1, p107 

    This paper addresses the problem of minimizing an arbitrary finite sum of products of two convex functions over a convex set. Nonconvex problems in this form constitute a class of generalized convex multiplicative problems. Convex analysis results allow to reformulate the problem as an...

  • Spatial Numerical Range of Operators on Weighted Hardy Spaces. Abdollahi, Abdolaziz; Heydari, Mohammad Taghi // International Journal of Mathematics & Mathematical Sciences;2011, p1 

    We consider the spatial numerical range of operators on weighted Hardy spaces and give conditions for closedness of numerical range of compact operators. We also prove that the spatial numerical range of finite rank operators on weighted Hardy spaces is star shaped; though, in general, it does...

  • A single interval based classifier. Kim, Heeyoung; Huo, Xiaoming; Shi, Jianjun // Annals of Operations Research;May2014, Vol. 216 Issue 1, p307 

    In many applications, it is desirable to build a classifier that is bounded within an interval. Our motivating example is rooted in monitoring in a stamping process. A novel approach is proposed and examined in this paper. Our method consists of three stages: (1) A baseline of each class is...

  • Quasi-convex Functions in Carnot Groups*. Mingbao Sun; Xiaoping Yang // Chinese Annals of Mathematics;Apr2007, Vol. 28 Issue 2, p235 

    In this paper, the authors introduce the concept of h-quasiconvex functions on Carnot groups G. It is shown that the notions of h-quasiconvex functions and h-convex sets are equivalent and the L ∞ estimates of first derivatives of h-quasiconvex functions are given. For a Carnot group G of...

  • Motzkin predecomposable sets. Iusem, A.; Martínez-Legaz, J.; Todorov, M. // Journal of Global Optimization;Dec2014, Vol. 60 Issue 4, p635 

    We introduce and study the family of sets in a finite dimensional Euclidean space which can be written as the Minkowski sum of a compact and convex set and a convex cone (not necessarily closed). We establish several properties of the class of such sets, called Motzkin predecomposable, some of...

  • On A Class of Generalised Convex Functions with Some Applications. Dash, Rajani B.; Dalai, Dhirendra K.; Mishra, Narayan; Pradhan, Saroj K. // International Journal of Applied Engineering Research (0976-4259;2010, Vol. 1 Issue 3, p491 

    Recently J Sandoor introduced the notion of A - Convexity. R.B. Dash etal [9] generalised the notions of B- sub additivity, antisymmetricity, A - convexity. In this paper, we further generalised these notions and applied their properties in different theorems and propositions.

  • Exact, Continuous Boundary Crossings Out of Convex Sets in RN. BRIDGES, DOUGLAS; POPA, GABRIELA // Quarterly Journal of Mathematics;Dec2003, Vol. 54 Issue 4, p391 

    The existence of the unique point at which a line segment crosses out of a located convex set in RN is proved constructively, and the continuity of the resulting mapping is investigated.

  • Sufficiency in Nonsmooth Multiobjective Programming Involving Generalized (F, ρ)-Convexity. NOBAKHTIAN, S. // Journal of Optimization Theory & Applications;Aug2006, Vol. 130 Issue 2, p359 

    In this paper, we consider a generalization of convexity for nonsmooth multiobjective programming problems. We obtain sufficient optimality conditions under generalized (F, ρ)-convexity.

  • Fekete-Szegö Inequality for a Subclass of p-valently Alpha Convex Functions. Mehrok, B. S.; Singh, Gagandeep // Scientia Magna;2014, Vol. 10 Issue 1, p51 

    In the present paper, we obtain sharp upper bound of the functional |ap+2 -- μa²p+1 | (μ real) for a subclass of p-valently alpha convex functions and deduce several results in the form of corollaries and remarks.

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics