
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Author description coming soon. We're reaching out to them in the ether...
This book investigates the development and application of a novel random search method for solving extreme point mathematical programming problems. The authors, Huu-Nhon Huynh and Santosh Kumar, present a rigorous mathematical framework for identifying optimal solutions in complex optimization landscapes. The methodology is designed to overcome the limitations of traditional deterministic approaches, particularly in high-dimensional or non-convex problems. The work details the theoretical underpinnings of the random search algorithm and provides insights into its computational efficiency and convergence properties.
This text is a specialized academic monograph focusing on advanced mathematical programming techniques. Its theoretical depth and focus on a specific algorithmic approach suggest it is intended for researchers and graduate students in operations research, applied mathematics, and computer science. The subject matter points to a dense, technical treatment of optimization theory.
Page Count:
17
Publication Date:
1988-01-01
Publisher:
Department of Mathematics, Royal Melbourne Institute of Technology
ISBN-10:
0864441487
ISBN-13:
9780864441485
No comments yet. Be the first to share your thoughts!