By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Review

Previous Article
The Discrete Cosine Transform
Each discrete cosine transform (DCT) uses $N$ real basis vectors whose components are cosines. In the DCT-4, for example, the $j$th component of $\boldv_k$ is $\cos (j + \frac{1}{2}) (k + \frac{1}{2}...
Next Article
Book Reviews
This issue of SIAM Review inaugurates a new feature of the Book Reviews section: occasional survey articles discussing a selection of books that deal with a particular subject. Suggestions for topics...

You are logged in to this journal.

Optimization Case Studies in the NEOS Guide

SIAM Rev. Volume 41, Issue 1, pp. 148-163 (1999)

Issue Date: 1999
FULL TEXT OPTIONS   (FREE)
Download PDF (322 kB) View Cart

We describe several of the case studies in the NEOS Guide, a site on the World Wide Web that contains informational and educational material about optimization. These studies show how optimization relates to practical applications. They guide the user through relevant details of the application, formulation, solution, and interpretation of the results. The studies use interactivity to build intuition, allowing users to define their own problems and examine the corresponding solutions. The studies can be used for assignments in optimization and operations research courses and as small self-guided units equivalent to one or two lecture classes.

©1999 Society for Industrial and Applied Mathematics
Permalink: http://dx.doi.org/10.1137/S0036144598334874

KEYWORDS and AMS

Keywords
AMS Subject Classifications
65K05, 90C05, 90C20

PUBLICATION DATA

ISSN:
0036-1445 (print)   1095-7200 (online)
Publisher:
AIP is a member of CrossRef SIAM

REFERENCES (12)
View in Separate Window/Tab
  1. Daniel Bienstock, Computational study of a family of mixed-integer quadratic programming problems, Math. Programming, 74 (1996), 121–140
  2. Pamela Williams, Amr El-Bakry, Richard Tapia, Computing an exact solution in interior-point methods for linear programming, Contemp. Math., Vol. 252, Amer. Math. Soc., Providence, RI, 1999, 9–29 [MathRev]
  3. J. Czyzyk, M. P. Mesnier, and J. J. Moré, The NEOS server, IEEE Computational Science and Engineering, 5 (1998), pp. 68–75. [Inspec]
  4. M. C. Ferris, M. P. Mesnier, and J. J. Moré, NEOS and Condor: Solving Optimization Problems Over the Internet, preprint ANL/MCS-P708-0398, MCS Division, Argonne National Laboratory, Argonne, IL, 1998.
  5. R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, The Scientific Press, South San Francisco, CA, 1993.
  6. P. C. Gilmore and R. E. Gomory, A linear programming approach to the cutting-stock problem, Oper. Res., 9 (1961), pp. 849–859. [ISI]
  7. P. C. Gilmore and R. E. Gomory, A linear programming approach to the cutting-stock problem—Part II, Oper. Res., 11 (1963), pp. 863–888. [ISI]
  8. H. Markowitz, Portfolio selection, Journal of Finance, 8 (1952), pp. 77–91.
  9. Harry Markowitz, Mean-variance analysisin portfolio choice and capital markets, Basil Blackwell, 1987xii+387 [MathRev]
  10. H. Markowitz, Portfolio Selection: Efficient Diversification of Investments, Basil Blackwell, Cambridge, MA, 1991.
  11. Jorge Moré, Stephen Wright, Optimization software guide, Frontiers in Applied Mathematics, Vol. 14, Society for Industrial and Applied Mathematics (SIAM), 1993xii+154 [MathRev]
  12. Andre Perold, Large-scale portfolio optimization, Management Sci., 30 (1984), 1143–1160 [MathRev]