The linear balancing flow problem
Article Abstract:
The Linear Flow Balancing Program is solved based on the assumption that each instance is a linear programming problem and on its interpretation as a flow problem on a bipartite network with gains. The purpose is to optimally balance the flow from a given set of nodes. An algorithm, which may be viewed as a special modification of the Simplex but which requires less memory and computing time, is suggested. The algorithm involves the association of a tree to the set of variables of the dual problem that are not within the current basis.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
User Contributions:
Comment about this article or add new information about this topic:
An experimental evaluation of the efficacy of four multi-objective linear programming algorithms
Article Abstract:
Two multi-objective linear programming algorithms, ARBDS and CONTEXT, outdo two others, GUESS and STEM, which are not based on the formal models of decision maker behavior. ARBDS performs better than GUESS as it passes through fewer iterations to reach a solution. CONTEXT, on the other hand, is also proven faster than STEM and also requires less iterations.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Frequency assignment in mobile radio systems using branch-and-cut techniques
Article Abstract:
A frequency assignment method for mobile radio systems in a geographical area is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
- Abstracts: Cash flow optimization in delivery scheduling. Efficient scheduling of periodic information monitoring requests
- Abstracts: Resource-constrained project scheduling: notation, classification, models, and methods. A new lower bound for the job-shop scheduling problem
- Abstracts: Faith in the future. Who done it? Kidnapping pandemic becomes a political football