[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
:: Volume 5, Issue 2 (10-2014) ::
IJOR 2014, 5(2): 0-0 Back to browse issues page
Generation of a reduced first - level mixed integer programmimg problem
Godfrey Chagwiza , Brian Jones, Senelani Hove- Musekwa, Sobona Mtisi
National University of Science & Technology , chagwizag@gmail.com
Abstract:   (8962 Views)

We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is developed. The proposed method of cuts generation, separation and strengthening is compared to the Gomory, linear branching and coordinated cutting plane methods. The computational results show that the proposed method is promising but becomes complicated as number of variables increases.

Keywords: Reduced first level, MIP, cutting planes
Full-Text [PDF 915 kb]   (5655 Downloads)    
Type of Study: Original | Subject: Discrete Optimization
Received: 2014/06/24 | Accepted: 2015/09/17 | Published: 2015/09/17
Send email to the article author

Add your comments about this article
Your username or Email:


XML     Print

Volume 5, Issue 2 (10-2014) Back to browse issues page
مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.05 seconds with 32 queries by YEKTAWEB 4215