Artículos relacionados a Quasiconvex Optimization and Location Theory: 9 (Applied...
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
Reseña del editor
This book includes variants of the ellipsoid method for convex and quasiconvex problems and applies them to very general convex and quasiconvex models in location theory.
It starts by describing the adopted notation and provides basic details of convexity and convex optimization. Without aiming at replacing classical references, it manages to bring the required concepts into an easily tractable form and to focus the reader on the more elaborate developments that follow. Many techniques in convex optimization rely on the use of separation hyperplanes. The book uses the ellipsoid method as an illustration of such a technique and provides a new and more stable version of this method. The new algorithm receives a clear and concise treatment, starting with its derivation and ending with its convergence analysis. Both the derivation and the analysis use a simpler approach than previously found in the literature.
The second part of the book generalizes the new algorithm to solve quasiconvex programs. Although the techniques required by the quasiconvex case are more complex, the book provides a clear and direct interpretation of the main theoretical results.
Audience: This book will be of great value to graduate students and researchers working in continuous optimization using separation techniques and for those dealing with general continuous location models.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 116,44
EUR 5,20 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Quasiconvex Optimization and Location Theory: 9 (Applied...
Imagen de archivo
Quasiconvex Optimization and Location Theory
Publicado por
SPRINGER NATURE, 1998
ISBN 10: 0792346947
ISBN 13: 9780792346944
Antiguo o usado
Tapa dura
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Gut. Zustand: Gut | Seiten: 219 | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 3016591/203
Cantidad disponible: 2 disponibles
Imagen de archivo
Quasiconvex Optimization and Location Theory (Applied Optimization, 9)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780792346944_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Quasiconvex Optimizations and Location Theory
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 755731-n
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Quasiconvex Optimization and Location Theory
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Nº de ref. del artículo: 458439731
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Quasiconvex Optimization and Location Theory
Impresión bajo demandaLibrería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 575. Nº de ref. del artículo: C9780792346944
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Quasiconvex Optimizations and Location Theory
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 755731-n
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Quasiconvex Optimization and Location Theory
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Neuware - 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. Nº de ref. del artículo: 9780792346944
Cantidad disponible: 2 disponibles
Imagen de archivo
Quasiconvex Optimizations and Location Theory
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 755731
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Quasiconvex Optimization and Location Theory (Applied Optimization, 9)
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA79707923469476
Cantidad disponible: 1 disponibles
Imagen del vendedor
Quasiconvex Optimizations and Location Theory
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 755731
Cantidad disponible: Más de 20 disponibles