0
Your cart

Your cart is empty

Books > Professional & Technical > Mechanical engineering & materials > Production engineering

Buy Now

Discrete and Fractional Programming Techniques for Location Models (Hardcover, 1998 ed.) Loot Price: R3,291
Discovery Miles 32 910
Discrete and Fractional Programming Techniques for Location Models (Hardcover, 1998 ed.): A. I. Barros

Discrete and Fractional Programming Techniques for Location Models (Hardcover, 1998 ed.)

A. I. Barros

Series: Combinatorial Optimization, 3

 (sign in to rate)
Loot Price R3,291 Discovery Miles 32 910 | Repayment Terms: R308 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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."

General

Imprint: Springer
Country of origin: Netherlands
Series: Combinatorial Optimization, 3
Release date: 2001
First published: 1998
Authors: A. I. Barros
Dimensions: 235 x 155 x 12mm (L x W x T)
Format: Hardcover
Pages: 180
Edition: 1998 ed.
ISBN-13: 978-0-7923-5002-6
Categories: Books > Science & Mathematics > Mathematics > Probability & statistics
Books > Professional & Technical > Mechanical engineering & materials > Production engineering > General
Promotions
LSN: 0-7923-5002-2
Barcode: 9780792350026

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners