Описание: The book discusses three classes of problems: the generalized Nash equilibrium problems, the bilevel problems and the mathematical programming with equilibrium constraints (MPEC).
Автор: Stephan Dempe Название: Foundations of Bilevel Programming ISBN: 1441952209 ISBN-13(EAN): 9781441952202 Издательство: Springer Рейтинг: Цена: 30606.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Bilevel programming problems are hierarchical optimization problems where the constraints of one problem (the so-called upper level problem) are defined in part by a second parametric optimization problem (the lower level problem).
Автор: Jonathan F. Bard Название: Practical Bilevel Optimization ISBN: 1441948074 ISBN-13(EAN): 9781441948076 Издательство: Springer Рейтинг: Цена: 48774.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Multiple objective programming deals with the extension of optimization techniques to account for several objective functions, while game theory deals with the inter-personal dynamics surrounding conflict.
Описание: Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems.
Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.
Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs).
On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.
Автор: Michael Patriksson Название: Nonlinear Programming and Variational Inequality Problems ISBN: 1441948066 ISBN-13(EAN): 9781441948069 Издательство: Springer Рейтинг: Цена: 26546.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other.
Описание: This book presents the details of the BONUS algorithm and its real world applications in areas like sensor placement in large scale drinking water networks, sensor placement in advanced power systems, water management in power systems, and capacity expansion of energy systems.
Автор: Michael Patriksson Название: Nonlinear Programming and Variational Inequality Problems ISBN: 0792354559 ISBN-13(EAN): 9780792354550 Издательство: Springer Рейтинг: Цена: 26546.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
