My Account Log in

1 option

Non-convex multi-objective optimization / by Panos M. Pardalos, Antanas Žilinskas, Julius Žilinskas.

Springer Nature - Springer Mathematics and Statistics eBooks 2017 English International Available online

View online
Format:
Book
Author/Creator:
Pardalos, Panos M., Author.
Zhilinskas, A., Author.
Žilinskas, Julius., Author.
Series:
Springer Optimization and Its Applications, 1931-6828 ; 123
Language:
English
Subjects (All):
Mathematical optimization.
Algorithms.
Computer science—Mathematics.
Computer science--Mathematics.
Computer science.
Optimization.
Mathematical Applications in Computer Science.
Local Subjects:
Optimization.
Algorithms.
Mathematical Applications in Computer Science.
Physical Description:
1 online resource (192 pages) : illustrations, tables.
Edition:
1st ed. 2017.
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2017.
Summary:
Recent results on non-convex multi-objective optimization problems and methods are presented in this book, with particular attention to expensive black-box objective functions. Multi-objective optimization methods facilitate designers, engineers, and researchers to make decisions on appropriate trade-offs between various conflicting goals. A variety of deterministic and stochastic multi-objective optimization methods are developed in this book. Beginning with basic concepts and a review of non-convex single-objective optimization problems; this book moves on to cover multi-objective branch and bound algorithms, worst-case optimal algorithms (for Lipschitz functions and bi-objective problems), statistical models based algorithms, and probabilistic branch and bound approach. Detailed descriptions of new algorithms for non-convex multi-objective optimization, their theoretical substantiation, and examples for practical applications to the cell formation problem in manufacturing engineering, the process design in chemical engineering, and business process management are included to aide researchers and graduate students in mathematics, computer science, engineering, economics, and business management. .
Contents:
1. Definitions and Examples
2. Scalarization
3. Approximation and Complexity
4. A Brief Review of Non-Convex Single-Objective Optimization
5. Multi-Objective Branch and Bound
6. Worst-Case Optimal Algorithms
7. Statistical Models Based Algorithms
8. Probabilistic Bounds in Multi-Objective Optimization
9. Visualization of a Set of Pareto Optimal Decisions
10. Multi-Objective Optimization Aided Visualization of Business Process Diagrams. –References
Index.
Notes:
Includes bibliographical references and index.
Description based on publisher supplied metadata and other sources.
ISBN:
3-319-61007-4
OCLC:
1021254520

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account