All Classes and Interfaces

Class
Description
 
 
 
 
A generic structure to hold the candidate points for a max variance kriging operation (See GeospataialSamplingGenerator)
This is an implementation of the most common way we'll want to use the KrigEvaluator.
A generic structure to hold the candidate points for a max variance kriging operation (See GeospataialSamplingGenerator)
 
 
An implementation of KrigDistance that normalized the variables to be on [0,1] and computed the Euclidean distance after normalization.
 
 
 
An shared implementation of KrigDistance that handles different types of variables: right now we handle locations and "default" which is just numeric.
An implementation of KrigDistance that normalized the variables to be on [0,1] and computed the Euclidean distance after normalization.
An implementation of KrigDistance that returns the "map distance" between two vectors on the surface of a sphere.
A generic structure to hold the candidate points for a max variance kriging operation (See GeospataialSamplingGenerator)
This is the an implementaion of a KrigTestPointSequence Upon construction it is given an array of points that it will return in order every time ::next() is called.
 
 
 
 
 
 
 
This is an interface for the Kriging generators to use implementations how to return points in the sequence every time ::next() is called.
 
Defines a callback function that will evaluate an OptQuestSolution during managed optimization.
Defines a callback function is called when a solution or replication solution has completed evaluation.
This is a specialization of KrigBaseTestPointSet This one will grow from minSize to maxSize, increasing by growthRate every time ::add is called and it will honor ::remove, but only after the monte carlo revisits in the KrigTestPoint are done
 
This is the an implementation of a KrigTestPointSequence Upon construction it is given an implementation of another KrigCandidatePointsSequence.
This is the an implementaion of a KrigTestPointSequence It will return a new nDims dimensional point from a QuasiRandom sequence every time ::next() is called.
This is the an implementaion of a KrigTestPointSequence Upon construction it is given an implementation of another KrigTestPointsSequence.
This is the simplest version of using Kriging to generate simulation locations.
This is the simplest version of using Kriging to generate simulation locations.
The main class that defines an optimization model and creates and manages solutions
 
 
 
 
 
The class that defines a solution object for managing inputs, outputs, constraints, and objectives