Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-x24gv Total loading time: 0 Render date: 2024-04-30T20:54:30.192Z Has data issue: false hasContentIssue false

6 - Multivariable Optimization with Constraints

Published online by Cambridge University Press:  05 February 2016

Suman Dutta
Affiliation:
Indian School of Mines
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2016

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bland, R. G., Goldfarb, D., Todd, M. J. 1981. Feature Article-The Ellipsoid Method: A Survey, Operations Research, 29(6): 1039-91.Google Scholar
Chong, E. K. P., Zak, S. H. 2001. An Introduction to Optimization Second Edition, John Wiley and Sons, Inc.Google Scholar
Dantzig, G. B. 1963. Linear Programming and Extensions, Princeton University Press.Google Scholar
Dantzig, G. B. 2002. Linear Programming, Operations Research, vol. 50, No. 1, January-February 2002, pp. 42-47.
Edgar, T. F., Himmelblau, D. M., Lasdon, L. S. 2001. Optimization of Chemical ProcessesMcGraw-Hill.Google Scholar
Feroymson, M. A. and Ray, T. L. 1966. A Branch-and-Bound Algorithm for Plant Location, Opns Res 14, 361-68.
Fletcher, R.Practical Methods of Optimization, John Wiley and Sons.CrossRef
Hancock, H., 1960. Theory of Maxima and Minima, New York: Dover.Google Scholar
Karmarkar, N. K. 1984. ‘A New Polynomial Time Algorithm for Linear Programming’, Combinatorica, 4, 373-95.
Khachiyan, L. G., 1979. A Polynomial Algorithm in Linear Programming. Doklady Akademiia Nauk SSSR, 244: 1093-96, English Translation: Soviet Mathematics Doklady, 20(1): 191-94,.
Land, A. H. and Doig, A. G.An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol. 28, No. 3. (Jul., 1960), pp. 497-520.Google Scholar
Lemire, N. 1989. An Introduction to Karmarkar's Method, Windsor Mathematics Report WMR 89-10; July, 1989.
Mitten, L. G. 1970. Branch-and-Bound Methods: General Formulation and Properties, Operations Research, vol. 18, No. 1, pp. 24-34.Google Scholar
Rao, S. S. 2009. Engineering Optimization: Theory and Practice (4e), Wiley and Sons, Inc.
Ravindran, A., Ragsdell, K. M., Reklaitis, G. V. 2006. Engineering Optimization: Methods and Applications, John Wiley and Sons, Inc.CrossRefGoogle Scholar
Rebennack, S. 2008. Ellipsoid Method, Encyclopedia of Optimization, Second Edition, C. A., Floudas and P. M., Pardalos (Eds.), Springer, pp. 890-99.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×