function value = camel_f ( m, n, x )

%*****************************************************************************80
%
%% camel_f() returns the function in the camel problem.
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    25 January 2016
%
%  Author:
%
%    John Burkardt
%
%  Reference:
%
%    Sashwati Ray, PSV Nataraj,
%    An efficient algorithm for range computation of polynomials using the
%    Bernstein form,
%    Journal of Global Optimization,
%    Volume 45, 2009, pages 403-426.
%
%  Input:
%
%    integer M, the number of variables.
%
%    integer N, the number of points.
%
%    real X(M,N), the points.
%
%  Output:
%
%    real VALUE(N), the value of the function at X.
%
  value(1:n) = ( ...
      4.0E+00           * x(1,1:n) .^2             ...
    - 2.1E+00           * x(1,1:n) .^4             ...
    + 1.0E+00 / 3.0E+00 * x(1,1:n) .^6             ...
    +                     x(1,1:n)     .* x(2,1:n) ...
    - 4.0E+00           * x(2,1:n) .^2             ...
    + 4.0E+00           * x(2,1:n) .^4 )';

  return
end


