Discrete and Fractional Programming Techniques for Location Models PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Discrete and Fractional Programming Techniques for Location Models PDF full book. Access full book title Discrete and Fractional Programming Techniques for Location Models by A.I. Barros. Download full books in PDF and EPUB format.
Author: A.I. Barros
Publisher: Springer Science & Business Media
ISBN: 1461540720
Category : Mathematics
Languages : en
Pages : 194
Get Book Here
Book Description
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.
Author: A.I. Barros
Publisher: Springer Science & Business Media
ISBN: 1461540720
Category : Mathematics
Languages : en
Pages : 194
Get Book Here
Book Description
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.
Author: E.B. Bajalinov
Publisher: Springer Science & Business Media
ISBN: 1441991743
Category : Mathematics
Languages : en
Pages : 442
Get Book Here
Book Description
This is a book on Linear-Fractional Programming (here and in what follows we will refer to it as "LFP"). The field of LFP, largely developed by Hungarian mathematician B. Martos and his associates in the 1960's, is concerned with problems of op timization. LFP problems deal with determining the best possible allo cation of available resources to meet certain specifications. In particular, they may deal with situations where a number of resources, such as people, materials, machines, and land, are available and are to be combined to yield several products. In linear-fractional programming, the goal is to determine a per missible allocation of resources that will maximize or minimize some specific showing, such as profit gained per unit of cost, or cost of unit of product produced, etc. Strictly speaking, linear-fractional programming is a special case of the broader field of Mathematical Programming. LFP deals with that class of mathematical programming problems in which the relations among the variables are linear: the con straint relations (i.e. the restrictions) must be in linear form and the function to be optimized (i.e. the objective function) must be a ratio of two linear functions.
Author: J.A. dos Santos Gromicho
Publisher: Springer Science & Business Media
ISBN: 1461333261
Category : Mathematics
Languages : en
Pages : 233
Get Book Here
Book Description
grams of which the objective is given by the ratio of a convex by a positive (over a convex domain) concave function. As observed by Sniedovich (Ref. [102, 103]) most of the properties of fractional pro grams could be found in other programs, given that the objective function could be written as a particular composition of functions. He called this new field C programming, standing for composite concave programming. In his seminal book on dynamic programming (Ref. [104]), Sniedovich shows how the study of such com positions can help tackling non-separable dynamic programs that otherwise would defeat solution. Barros and Frenk (Ref. [9]) developed a cutting plane algorithm capable of optimizing C-programs. More recently, this algorithm has been used by Carrizosa and Plastria to solve a global optimization problem in facility location (Ref. [16]). The distinction between global optimization problems (Ref. [54]) and generalized convex problems can sometimes be hard to establish. That is exactly the reason why so much effort has been placed into finding an exhaustive classification of the different weak forms of convexity, establishing a new definition just to satisfy some desirable property in the most general way possible. This book does not aim at all the subtleties of the different generalizations of convexity, but concentrates on the most general of them all, quasiconvex programming. Chapter 5 shows clearly where the real difficulties appear.
Author: Nicolas Hadjisavvas
Publisher: Springer Science & Business Media
ISBN: 0387233938
Category : Mathematics
Languages : en
Pages : 684
Get Book Here
Book Description
Studies in generalized convexity and generalized monotonicity have significantly increased during the last two decades. Researchers with very diverse backgrounds such as mathematical programming, optimization theory, convex analysis, nonlinear analysis, nonsmooth analysis, linear algebra, probability theory, variational inequalities, game theory, economic theory, engineering, management science, equilibrium analysis, for example are attracted to this fast growing field of study. Such enormous research activity is partially due to the discovery of a rich, elegant and deep theory which provides a basis for interesting existing and potential applications in different disciplines. The handbook offers an advanced and broad overview of the current state of the field. It contains fourteen chapters written by the leading experts on the respective subject; eight on generalized convexity and the remaining six on generalized monotonicity.
Author: Teodor Gabriel Crainic
Publisher: Springer Nature
ISBN: 3031576039
Category :
Languages : en
Pages : 506
Get Book Here
Book Description
Author: Igor V. Konnov
Publisher: Springer Science & Business Media
ISBN: 3540370072
Category : Business & Economics
Languages : en
Pages : 465
Get Book Here
Book Description
The book contains invited papers by well-known experts on a wide range of topics (economics, variational analysis, probability etc.) closely related to convexity and generalized convexity, and refereed contributions of specialists from the world on current research on generalized convexity and applications, in particular, to optimization, economics and operations research.
Author: Andrew Eberhard
Publisher: Springer Science & Business Media
ISBN: 0387236392
Category : Business & Economics
Languages : en
Pages : 342
Get Book Here
Book Description
In recent years there is a growing interest in generalized convex fu- tions and generalized monotone mappings among the researchers of - plied mathematics and other sciences. This is due to the fact that mathematical models with these functions are more suitable to describe problems of the real world than models using conventional convex and monotone functions. Generalized convexity and monotonicity are now considered as an independent branch of applied mathematics with a wide range of applications in mechanics, economics, engineering, finance and many others. The present volume contains 20 full length papers which reflect c- rent theoretical studies of generalized convexity and monotonicity, and numerous applications in optimization, variational inequalities, equil- rium problems etc. All these papers were refereed and carefully selected from invited talks and contributed talks that were presented at the 7th International Symposium on Generalized Convexity/Monotonicity held in Hanoi, Vietnam, August 27-31, 2002. This series of Symposia is or- nized by the Working Group on Generalized Convexity (WGGC) every 3 years and aims to promote and disseminate research on the field. The WGGC (http://www.genconv.org) consists of more than 300 researchers coming from 36 countries.
Author: Vladimir Boltyanski
Publisher: Springer Science & Business Media
ISBN: 9780792354543
Category : Computers
Languages : en
Pages : 448
Get Book Here
Book Description
This book focuses on three disciplines of applied mathematics: control theory, location science and computational geometry. The authors show how methods and tools from convex geometry in a wider sense can help solve various problems from these disciplines. More precisely they consider mainly the tent method (as an application of a generalized separation theory of convex cones) in nonclassical variational calculus, various median problems in Euclidean and other Minkowski spaces (including a detailed discussion of the Fermat-Torricelli problem) and different types of partitionings of topologically complicated polygonal domains into a minimum number of convex pieces. Figures are used extensively throughout the book and there is also a large collection of exercises. Audience: Graduate students, teachers and researchers.
Author: Alberto Cambini
Publisher: Springer Science & Business Media
ISBN: 3540708766
Category : Mathematics
Languages : en
Pages : 252
Get Book Here
Book Description
The authors have written a rigorous yet elementary and self-contained book to present, in a unified framework, generalized convex functions. The book also includes numerous exercises and two appendices which list the findings consulted.
Author: Joel D. Wisner
Publisher: SAGE Publications
ISBN: 1483383083
Category : Business & Economics
Languages : en
Pages : 1363
Get Book Here
Book Description
Finally, an operations management book to get excited about. Operations Management: A Supply Chain Process Approach exposes students to the exciting and ever-changing world of operations management through dynamic writing, application, and cutting-edge examples that will keep students interested and instructors inspired! Author Dr. Joel Wisner understands that today’s students will be entering a highly competitive global marketplace where two things are crucial: a solid knowledge of operations management and an understanding of the importance for organizations to integrate their operations and supply chain processes. With this in mind, Wisner not only provides a clear and comprehensive introduction to operations management, but also gives attention to the important processes involved in linking firms’ operations in a supply chain environment.
