nondifferentiable programming

nondifferentiable programming

[¦nän‚dif·ə′ren·chə·bəl ′prō‚gram·iŋ] (mathematics) The branch of nonlinear programming which does not require the objective and constraint functions to be differentiable.