1.2.5 Constrained and Unconstrained Optimization
INPUT OUTPUT
Input Description:
A function
f(x_1,...,x_n)
.
Problem:
What point
p = (p_z,...,p_n)
maximizes (or equivallently minimizes)
the function
f
?
Implementations
Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 8)
Adaptive Simulated Annealing (C) (rating 6)
Genocop -- Optimization via Genetic Algorithms (C) (rating 5)
Related Problems
Linear Programming
Random Number Generation
Satisfiability
Go to the corresponding chapter in the book
About the Book
Send us Mail
Go to Main Page
This page last modified on Tue Jun 03, 1997
.