Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning

We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land parcels within a given budget. This problem can be solved by standard integer programming methods using the sample average approximation (SAA) scheme. Our main contribution lies in exploiting the separable structure present in this problem and using Lagrangian relaxation techniques to gain scalability over the flat representation. We also generalize the approach to allow the application of the SAA scheme to a range of stochastic optimization problems. Our iterative approach is highly efficient in terms of space requirements and it provides an upper bound over the optimal solution at each iteration. We apply our approach to the Red-cockaded Woodpecker conservation problem. The results show that it can find the optimal solution significantly faster--sometimes by an order-of-magnitude--than using the flat representation for a range of budget sizes.

[1]  Andreas Krause,et al.  Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks , 2008 .

[2]  Nikos Komodakis,et al.  MRF Energy Minimization and Beyond via Dual Decomposition , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Stephen P. Boyd,et al.  Subgradient Methods , 2007 .

[4]  Andreas Krause,et al.  Dynamic Resource Allocation in Conservation Planning , 2011, AAAI.

[5]  Tommi S. Jaakkola,et al.  Introduction to dual composition for inference , 2011 .

[6]  Victor M. Zavala,et al.  Scalable stochastic optimization of complex energy systems , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[7]  D. Sontag.  1 Introduction to Dual Decomposition for Inference , 2010 .

[8]  Stephen J. Wright,et al.  Optimization for Machine Learning , 2013 .

[9]  Ashish Sabharwal,et al.  An Empirical Study of Optimization for Maximizing Diffusion in Networks , 2010, CP.

[10]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[11]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[12]  David B. Shmoys,et al.  Maximizing the Spread of Cascades Using Network Design , 2010, UAI.

[13]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[14]  Alexander M. Rush,et al.  On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing , 2010, EMNLP.

[15]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[16]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..