Name
Abstract | ||
|---|---|---|
<P>We show how techniques of interval arithmetic can be used to give bounds on the global minima of unconstrained optimization problems. We illustrate the techniques using the design of a hypothetical chemical plant.</P> |
Year | DOI | Venue |
|---|---|---|
1979 | 10.1287/opre.27.4.743 | Operations Research |
Keywords | Field | DocType |
nonlinear programming,arithmetic,interval arithmetic,optimization,chemical engineering | Mathematical optimization,Affine arithmetic,Arbitrary-precision arithmetic,Nonlinear programming,Algorithm,Maxima and minima,Interval arithmetic,Optimization problem,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
27 | 4 | 0030-364X |
Citations | PageRank | References |
5 | 1.22 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. J. Mancini | 1 | 6 | 1.62 |
| G. P. McCormick | 2 | 15 | 15.01 |