Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics and Decision Sciences
Volume 2007, Article ID 56404, 11 pages
http://dx.doi.org/10.1155/2007/56404
Research Article

A Decomposition-Based Pricing Method for Solving a Large-Scale MILP Model for an Integrated Fishery

Department of Management, University of Canterbury, Private Bag 4800, Christchurch 8020, New Zealand

Received 6 September 2006; Revised 11 January 2007; Accepted 5 June 2007

Academic Editor: Stefanka Chukova

Copyright © 2007 M. Babul Hasan and John F. Raffensperger. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. B. Mikalsen and T. Vassdal, “A short term production planning model in fish processing,” in Applied Operations Research in Fishing, K. B. Haley, Ed., pp. 223–233, Plenum Press, New York, NY, USA, 1981. View at Google Scholar
  2. P. Jensson, “Daily production planning in fish processing firms,” European Journal of Operational Research, vol. 36, no. 3, pp. 410–415, 1988. View at Publisher · View at Google Scholar
  3. E. A. Gunn, H. H. Millar, and S. M. Newbold, “Planning harvesting and marketing activities for integrated fishing firms under an enterprise allocation scheme,” European Journal of Operational Research, vol. 55, no. 2, pp. 243–259, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. M. B. Hasan and J. F. Raffensperger, “A mixed integer linear program for an integrated fishery,” ORiON, vol. 22, no. 1, pp. 19–34, 2006. View at Google Scholar
  5. A. M. Geoffrion, “Lagrangean relaxation for integer programming,” Mathematical Programming Study, no. 2, pp. 82–114, 1974. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. M. L. Fisher, “The Lagrangian relaxation method for solving integer programming problems,” Management Science, vol. 27, no. 1, pp. 1–18, 1981. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. M. Held, P. Wolfe, and H. P. Crowder, “Validation of subgradient optimization,” Mathematical Programming, vol. 6, no. 1, pp. 62–88, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. M. Held and R. M. Karp, “The traveling-salesman problem and minimum spanning trees,” Operations Research, vol. 18, no. 6, pp. 1138–1162, 1970. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. F. Shepardson and R. E. Marsten, “A Lagrangean relaxation algorithm for the two duty period scheduling problem,” Management Science, vol. 26, no. 3, pp. 274–281, 1980. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. M. Guignard and S. Kim, “Lagrangean decomposition: a model yielding stronger Lagrangean bounds,” Mathematical Programming, vol. 39, no. 2, pp. 215–228, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, USA, 1963. View at Zentralblatt MATH · View at MathSciNet
  12. R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modelling Language for Mathematical Programming, Curt Hinrichs, Pacific Grove, Calif, USA, 1993.
  13. J. W. Mamer and R. D. McBride, “A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem,” Management Science, vol. 46, no. 5, pp. 693–709, 2000. View at Publisher · View at Google Scholar