discrete fractional programming techniques di barros (37 risultati)

Condizione: Good. Dissertatie met los stellingenblad.

Broschiert. Condizione: Gut. 148 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); Schnitt und Einband sind etwas staubschmutzig; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Text in ENGLISCHER Sprache! Sprache: Englisch Gewicht in Gramm: 300.

Condizione: very good. Amsterdam: Thesis,1995. Paperback. viii,148p. Diss. (Tinbergen Institute Research Series 89). Condition : very good copy. ISBN 9789051703207. Keywords : ECONOMICS, statistics.

Condizione: New.

Condizione: New. In.

Condizione: New.

Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Condizione: As New. Unread book in perfect condition.

Condizione: New. pp. 200.

Paperback. Condizione: Brand New. reprint edition. 198 pages. 9.25x6.10x0.46 inches. In Stock.

Condizione: New.

Paperback. Condizione: new. Paperback. 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. Three basic classes can be identified in location analysis: continuous location, network location and dis crete location. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condizione: New.

Condizione: New. In.

Condizione: New.

Hardcover. Condizione: Fine.

Paperback. Condizione: new. Paperback. 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. Three basic classes can be identified in location analysis: continuous location, network location and dis crete location. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Gebunden. Condizione: New.

Condizione: New.

Condizione: New. pp. 200.

Condizione: New. Integrating two seemingly unrelated fields - location analysis and fractional programming - this book tackles several location models that require combined solution techniques and theoretical results from both fields. It is suitable for researchers in mathematics, operations research and management science interested in combinatorial optimization. Series: Combinatorial Optimization. Num Pages: 198 pages, biography. BIC Classification: PBT; TGP. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 12. Weight in Grams: 1010. . 1998. Hardback. . . . .

Condizione: New.

Hardcover. Condizione: new. Hardcover. This book is a revised and updated version of the INFORMS award winner for "best dissertation on Location Analysis of 1995". The book integrates two seemingly unrelated fields: location analysis and fractional programming. Location analysis deals with the problem of where to locate facilities in such a way as to optimize a particular criterion taking into account the existing clients. Fractional programming is a special field of nonlinear programming dealing with optimization problems where the objective function consists of a ratio of given functions. Although the application scope of fractional programming is vast, it has not been much related to specific operations-research problems, and in particular, to location analysis. This book bridges the gap by tackling several location models that require combined solution techniques and theoretical results from both fields. Included are results in discrete location, especially in two-level location models, and the theoretical and practical potential of fractional programming in location theory.The book should be of value to researchers in mathematics, operations research and management science interested in combinatorial optimization, fractional programming, and location theory. Three basic classes can be identified in location analysis: continuous location, network location and dis crete location. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Buch. Condizione: Neu. Neuware - 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.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Like New. Like New. book.

Condizione: New. Integrating two seemingly unrelated fields - location analysis and fractional programming - this book tackles several location models that require combined solution techniques and theoretical results from both fields. It is suitable for researchers in mathematics, operations research and management science interested in combinatorial optimization. Series: Combinatorial Optimization. Num Pages: 198 pages, biography. BIC Classification: PBT; TGP. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 12. Weight in Grams: 1010. . 1998. Hardback. . . . . Books ship from the US and Ireland.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: new. Hardcover. This book is a revised and updated version of the INFORMS award winner for "best dissertation on Location Analysis of 1995". The book integrates two seemingly unrelated fields: location analysis and fractional programming. Location analysis deals with the problem of where to locate facilities in such a way as to optimize a particular criterion taking into account the existing clients. Fractional programming is a special field of nonlinear programming dealing with optimization problems where the objective function consists of a ratio of given functions. Although the application scope of fractional programming is vast, it has not been much related to specific operations-research problems, and in particular, to location analysis. This book bridges the gap by tackling several location models that require combined solution techniques and theoretical results from both fields. Included are results in discrete location, especially in two-level location models, and the theoretical and practical potential of fractional programming in location theory.The book should be of value to researchers in mathematics, operations research and management science interested in combinatorial optimization, fractional programming, and location theory. Three basic classes can be identified in location analysis: continuous location, network location and dis crete location. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.