Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Normal view MARC view ISBD view

Non-Convex Multi-Objective Optimization [electronic resource] / by Panos M. Pardalos, Antanas Žilinskas, Julius Žilinskas.

By: Pardalos, Panos M [author.].
Contributor(s): Žilinskas, Antanas [author.] | Žilinskas, Julius [author.] | SpringerLink (Online service).
Material type: TextTextSeries: Springer Optimization and Its Applications: 123Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Description: XII, 192 p. 18 illus., 4 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319610078.Subject(s): Mathematical optimization | Algorithms | Optimization | Algorithms | Mathematical Applications in Computer ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 519.6 Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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. .
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

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.

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. .

There are no comments for this item.

Log in to your account to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in


Visitor Counter