Discrete and Fractional Programming Techniques for Location Models

Name: Discrete and Fractional Programming Techniques for Location Models
Brand: Springer
SKU: 9780792350026
Price: 2796 CZK
Availability: InStock

Autor: A. I. Barros

Jazyk:

Vazba: Pevná

Vydavatel: Springer

Dostupnost: Skladem u dodavatele v malém množství

Odesíláme za 13-18 dnů

2 796 Kč

At first sight discrete and fractional programming techniques appear to be two com pletely unrelated...

Informace o knize

Autor

A. I. Barros

Jazyk

Angličtina

Vazba

Kniha - Pevná

Vydáno

1998

Stránek

180

EAN

9780792350026

ISBN

0792350022

Enbook ID

02716369

Vydavatel

Springer

Hmotnost

1010

Rozměry

155 x 235 x 13

Kompletní popis

At first sight discrete and fractional programming techniques appear to be two com pletely unrelated fields in operations research. We will show how techniques in both fields can be applied separately and in a combined form to particular models in location analysis. Location analysis deals with the problem of deciding where to locate facilities, con sidering the clients to be served, in such a way that a certain criterion is optimized. The term "facilities" immediately suggests factories, warehouses, schools, etc. , while the term "clients" refers to depots, retail units, students, etc. Three basic classes can be identified in location analysis: continuous location, network location and dis crete location. The differences between these fields arise from the structure of the set of possible locations for the facilities. Hence, locating facilities in the plane or in another continuous space corresponds to a continuous location model while finding optimal facility locations on the edges or vertices of a network corresponds to a net work location model. Finally, if the possible set of locations is a finite set of points we have a discrete location model. Each of these fields has been actively studied, arousing intense discussion on the advantages and disadvantages of each of them. The usual requirement that every point in the plane or on the network must be a candidate location point, is one of the mostly used arguments "against" continuous and network location models.

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Discrete and Fractional Programming Techniques for Location Models

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také