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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Copyright © 2003-2025 Farlex, Inc
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.