Research indexJournal article
A NOTE ON USER SOLUTION STRATEGY FOR MIXED‐INTEGER LINEAR PROGRAMMING MODELS
Rowse
Decision Sciences1 Jan 1981
NobleIDark:/48914/w1/20260524/545F7F7CDOI10.1111/j.1540-5915.1981.tb00066.x
A NOTE ON USER SOLUTION STRATEGY FOR MIXED‐INTEGER LINEAR PROGRAMMING MODELS
Rowse · Decision Sciences · 1981 · Subscription
NobleIDark:/48914/w1/20260524/545F7F7CDOI10.1111/j.1540-5915.1981.tb00066.x
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Large‐scale mixed‐integer linear programming (MILP) models may easily prove extraordinarily difficult to solve, even with efficient commercially implemented MILP solution codes. Drawing on experience gained in solving and analyzing three intertemporal investment planning MILP models for electric power supply, this note offers several practical suggestions for reducing computer solution times for general production‐allocation MILP models. Solution time reduction stems from judicious use of the powerful computational capabilities of existing commercial linear programming codes in conjunction with information known or to be learned by the practitioner about the model's structure.