Computing in operations research using Julia

INFORMS Journal on Computing

Volumn 27, Issue 2, 2015, Pages 238-248

  Lubin, Miles ^a   Dunning, Iain ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algebraic modeling; Metaprogramming; Programming languages; Scientific computing

Indexed keywords

ALGEBRA; BENCHMARKING; BRIDGES; COMPUTER PROGRAMMING LANGUAGES; MATLAB; MODELING LANGUAGES; NATURAL SCIENCES COMPUTING; NONLINEAR PROGRAMMING; OPERATIONS RESEARCH; PROGRAM COMPILERS;

ALGEBRAIC MODELING; JUST-IN-TIME COMPILATION; MATHEMATICAL OPTIMIZATIONS; META PROGRAMMING; NON-LINEAR OPTIMIZATION; NUMERICAL COMPUTING; PARTIAL IMPLEMENTATION; STATE-OF-THE-ART PERFORMANCE;

C++ (PROGRAMMING LANGUAGE);

EID: 84928627626     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.2014.0623     Document Type: Article

References (25)

1. Andersson J (2013) A general-purpose software framework for dynamic optimization. Ph.D. thesis, Arenberg Doctoral School, KU Leuven, Department of Electrical Engineering (ESAT/SCD) and Optimization in Engineering Center, Heverlee, Belgium.
2. Belotti P, Lee J, Liberti L, Margot F, Wächter A (2009) Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Software 24(4-5):597-634.
3. Bezanson J, Karpinski S, Shah VB, Edelman A (2012) Julia: A fast dynamic language for technical computing. Accessed January 29, 2015, http://arxiv.org/abs/1209.5145.
4. Bixby RE (2002) Solving real-world linear programs: A decade and more of progress. Oper. Res. 50(1):3-15.
5. th Workshop Implementation, Compilation, Optim. Object-Oriented Languages Programming Systems, ICOOOLPS '09 (ACM, New York), 18-25.
6. Brooke A, Kendrick D, Meeraus A, Raman R (1988) GAMS: A User's Guide (Scientific Press, Redwood City, CA).
7. Duff IS, Grimes RG, Lewis JG (1989) Sparse matrix test problems. ACM Trans. Math. Software 15(1):1-14.
8. Fourer R, Orban D (2010) DrAmpl: A meta solver for optimization problem analysis. Comput. Management Sci. 7(4):437-463.
9. nd ed. (Brooks/Cole, Pacific Grove, CA).
10. Gay DM (1985) Electronic mail distribution of linear programming test problems. Math. Programming Soc. COAL Newsletter 13:10-12.
11. Gay DM (1996) More AD of nonlinear AMPL models: Computing Hessian information and exploiting partial separability. Berz M, Bischof C, Corliss G, Griewank A, eds. Computational Differentiation: Applications, Techniques, and Tools (SIAM, Philadelphia), 173-184.
12. Gay DM (1997) Hooking your solver to AMPL. Technical report, Bell Laboratories, Murray Hill, NJ.
13. Grant MC, Boyd SP (2013) The CVX users' guide (release 2.0). Accessed May 1, 2013, http://cvxr.com/cvx/doc/CVX.pdf.
14. Hall J (2010) Towards a practical parallelisation of the simplex method. Comput. Management Sci. 7(2):139-170.
15. Hall J, McKinnon K (2005) Hyper-sparsity in the revised simplex method and how to exploit it. Comput. Optim. Appl. 32(3):259-283.
16. Harris PMJ (1973) Pivot selection methods of the DEVEX LP code. Math. Programming 5(1):1-28.
17. Hart WE, Watson J-P, Woodruff DL (2011) Pyomo: Modeling and solving mathematical programs in Python. Math. Programming Comput. 3(3):219-260.
18. Koberstein A (2005) The dual simplex method, techniques for a fast and stable implementation. Unpublished doctoral thesis, Universität Paderborn, Paderborn, Germany.
19. Lattner C, Adve V (2004) LLVM: A compilation framework for lifelong program analysis and transformation. Code Generation Optim., 2004. Internat. Sympos., Palo Alto, CA, 75-86.
20. Lofberg J (2004) YALMIP: A toolbox for modeling and optimization in MATLAB. Comput. Aided Control Systems Design, 2004 IEEE Internat. Sympos., Taipai, Taiwan, 284-289.
21. Maros I (2003) Computational Techniques of the Simplex Method (Kluwer Academic Publishers, Norwell, MA).
22. Mitchell S, O'Sullivan M, Dunning I (2011) Pulp: A linear programming toolkit for python. Accessed May 1, 2013, https://code.google.com/p/pulp-or/.
23. Mittelmann H (2013) Benchmarks for optimization software. Accessed April 28, 2013, http://plato.la.asu.edu/bench.html.
24. Suhl UH, Suhl LM (1990) Computing sparse LU factorizations for large-scale linear programming bases. ORSA J. Comput. 2(4):325-335.
25. van der Walt S, Colbert SC, Varoquaux G (2011) The NumPy array: A structure for efficient numerical computation. Comput. Sci. Engrg. 13(2):22-30.