RT Generic
T1 AMA 492 : implicit enumeration binary integer programming : balas algorithm
A1 Martín Pérez, Carlos
A2 University of Sheffield, 
AB We know that there are important economic problems which have mathematical models that are linear programs with integer variables. Among these problems are those that have variables taking only one of the values 0 or 1. Such binary integer programs, serve as mathematical models for capital budgeting, project selection, pipeline or communications network design, structural design, switching circuit design, information retrieval, fault detection, design of experiments, facility location, truck dispatching, tanker routing, crew scheduling, machine sequencing, and a host of other decision problems involving logical alternatives. Because of the importance of these decision problems the project considers a program developed in C++ that solves linear programs with variables constrained to take only one of the values 0 or 1 following the steps of the algorithm that the prestigious mathematician, Egon Balas, developed in 1965. In this document we are going to study the basic ideas and outline of the algorithm, and subsequently we will analyze the algorithm in detail, showing interesting examples like the Diet Problem with 96 variables. Finally we will show a tutorial of the application and we will draw conclusions of the operation of the algorithm.
YR 2010
FD 2010-06
LK https://hdl.handle.net/10016/10290
UL https://hdl.handle.net/10016/10290
LA eng
DS e-Archivo
RD 20 may. 2024