A New Decomposition-Based Pricing Technique For Solving Large-Scale Mixed IP with a Computer Technique

Authors

  • A Islam Department of Mathematics, Dhaka University of Engineering & Technology, Gazipur
  • M Babul Hasan Department of Mathematics, University of Dhaka, Dhaka-1000
  • HK Das Department of Mathematics and Statistics, Concordia University, Montr´eal, Quebec, H3G 1M8

DOI:

https://doi.org/10.3329/ganit.v34i0.28549

Keywords:

Lagrangian Dual, Sub-problem, Master-problem, Decomposition, DBP, Dual Pricing, MIP, AMPL

Abstract

In this paper, we develop a new Decomposition-Based Pricing (DBP) procedure to filter the unnecessary decision ingredients from large scale mixed integer programming (MIP) problem, where the variables are in huge number will be abated and the complicacy of restrictions will be straightforward. We then develop a generalized computer technique corresponding to our new DBP method by using the programming language A Mathematical Programming Language (AMPL). A number of examples have been illustrated to demonstrate our method.

GANIT J. Bangladesh Math. Soc.Vol. 34 (2014) 5-20

Downloads

Download data is not yet available.
Abstract
101
PDF
65

Author Biography

A Islam, Department of Mathematics, Dhaka University of Engineering & Technology, Gazipur



Downloads

Published

2016-06-28

How to Cite

Islam, A., Hasan, M. B., & Das, H. (2016). A New Decomposition-Based Pricing Technique For Solving Large-Scale Mixed IP with a Computer Technique. GANIT: Journal of Bangladesh Mathematical Society, 34, 5–20. https://doi.org/10.3329/ganit.v34i0.28549

Issue

Vol. 34 (2014)

Section

Articles

License

The copyright of GANIT: Journal of Bangladesh Mathematical Society is reserved by Bangladesh Mathematical Society (web: https://bdmathsociety.org/)