1Blurb::
2Total number of points in search pattern
3Description::
4If \c pattern_basis is \c simplex, then pattern search uses a minimal
5positive basis simplex for the parameter space, for a total of \e n+1
6function evaluations in the pattern.  Note that the \c simplex pattern
7basis can be used for unbounded problems only.  The \c
8total_pattern_size specification can be used to augment the basic \c
9coordinate and \c simplex patterns with additional function
10evaluations, and is particularly useful for parallel load balancing.
11For example, if some function evaluations in the pattern are dropped
12due to duplication or bound constraint interaction, then the \c
13total_pattern_size specification instructs the algorithm to generate
14new offsets to bring the total number of evaluations up to this
15consistent total.
16
17Topics::
18Examples::
19Theory::
20Faq::
21See_Also::
22