A primal simplex approach to pure processing networks
Article Abstract:
An examination of pure processing network (PPN) problems (or minimum cost flow problems), where conservation of flow holds both at nodes and along arcs, leads to the generation of two primal simplex approach variants (algorithms 1 and 2). These approach variants are described and explained. The more general, algorithm 1, requires no particular PPN basis structure assumptions. Algorithm 2's computations are reviewed, including test problems, results, and effects of changes in capacity or number of processing columns. When the two algorithms were tested on 64 randomly created problems (that involved as many as 208 processing columns), the more general algorithm was far slower and less effective than the more specialized approach of algorithm 2.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1986
User Contributions:
Comment about this article or add new information about this topic:
Unification of linear programming with a rule-based system by the post-model analysis approach
Article Abstract:
An attempt is made to integrate a linear programming model with a rule-based system through overlapped decision variables. This unified model is essentially a multi-objective decisionmaking problem that addresses numeric as well as symbolic objectives and decision variables. The problem is solved by applying the Post-model analysis approach, which embraces non-dominated tradeoffs among the numeric and symbolic objectives. The unification of linear programming and rule-based systems is highly beneficial when optimization models require semantic level sensitivity analysis. Because there is a direction toward downsized distributed computing environment, application of the unified approaches in different computers will become more common.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
Mitigating end effects in the dynamic vehicle allocation model
Article Abstract:
The dynamic vehicle allocation (DVA) is a class of network models developed to find the optimal use of vehicle fleets. The linear objective functions of DVA models suffer from distortions introduced by using finite planning horizons. These distortions are referred to as end effects. Several approaches are presented in which the end effects are mitigated by solving finite linear programs that can be represented as generalized networks. The results from a set of numerical experiments where various approximations are used to solve the DVA are presented.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1988
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Judgmental approach to forecasting bankruptcy. Forecasting with limited information: a study of the Norwegian ISDN access market
- Abstracts: The tolerance approach to sensitivity analysis of matrix coefficients in linear programming. Applications of integer programming in radio frequency management
- Abstracts: Application of game theoretic analysis to a problem in demography. Strategic implications of market share attraction models
- Abstracts: A portfolio approach to risk reduction in discretely rebalanced option hedges. The effects of the sample size, the investment horizon and market conditions on the validity of composite performance measures: a generalization
- Abstracts: Organizational integration and process innovation. U.S.-Japanese manufacturing equity relationships