Revision as of 13:34, 12 August 2017 edit InternetArchiveBot (talk \| contribs) Bots, Pending changes reviewers 5,675,103 edits Notification of altered sources needing review #IABot (v1.5beta) ← Previous edit		Revision as of 13:58, 25 January 2019 edit undo Petergans (talk \| contribs) Extended confirmed users 13,256 edits →Non-negativity constraints: new section Next edit →
Line 64: Cheers.—[[User:InternetArchiveBot\|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot\|Report bug]])</span> 13:34, 12 August 2017 (UTC) == Non-negativity constraints == A non-negativity constraint may be applied very simply to a parameter whose value is to be determined by means of a change of variable. For example, constraining the value of x to be positive may be achieved by determining the value of a parameter p which is numerically equal to x<sup>2</sup>. See, for example, Non-linear Optimization Techniques, by M.J. Box, D.Davies and W.H.Swan, published by Oliver & Boyd, Edinburgh, 1969, Chapter 5 "Constrained Optimization" for more examples. This is very useful when the parameter concerned is the value of a physical object which, by its nature, must be a positive number. [[User:Petergans\|Petergans]] ([[User talk:Petergans\|talk]]) 13:58, 25 January 2019 (UTC)

Talk:Constraint programming: Difference between revisions