Parametric solution for linear bicriteria knapsack models
Article Abstract:
A knapsack problem with two linearly weighted, objective criteria is examined. Parametric solutions are derived for this particular problem through the formulation of a linear bicriteria algorithm, which is based on deriving a longest path in a network which compactly incorporates all possible solutions to the knapsack problem. This algorithm is efficient in developing the parametric solution in time that is linear in the product of the number of variables, the resource limit and the number of vectors constituting the solution. The required amount of memory is linear in the product of the number of variables and the resource limit. In computational tests, problems of 36 variables were solved in only a few minutes on a 286-20 MHz DOS machine. Much larger instances can therefore be solved in more sophisticated computers.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
A bicriteria mathematical programming model for nutrition planning in developing nations
Article Abstract:
A bicriteria mathematical programming model is established for minimum nutritional levels in developing countries. The model generates a set of diet plans which do not require advance specification of nutrients. The diets generated satisfy a variety of nutritional requirements, trading off between energy and protein intake. Nutrition planners can decide from the diets which plan is most appropriate for a given need.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1987
User Contributions:
Comment about this article or add new information about this topic:
Multiple objective linear programming with parametric criteria coefficients
Article Abstract:
The multiple objective linear program problem with parametric criteria coefficients is studied. Properties of the problem and the range set are evolved, and for generating the set of extreme points that are weakly-efficient, an algorithm is detailed. The Generalized Benders Decomposition method is utilized to implement the algorithm and the computational results of the thirty-six test problems are listed.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1985
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A mixed integer programming model for solving a layout problem in the fashion industry. A cluster - analytic approach to facility layout
- Abstracts: Quality, strategy, and competitiveness. A Silicon Island of the East: creating a semiconductor industry in Singapore
- Abstracts: Beta in linear risk tolerance economies. Sensitivity analysis for mean-variance portfolio problems. Estimating market model betas: a comparison of random coefficient methods and their ability to correctly identify random variation
- Abstracts: Infinite horizon production planning in time-varying systems with convex production and inventory costs. Optimal capacity expansion over an infinite horizon
- Abstracts: Information systems planning: a model and empirical tests. Robust capacity planning under uncertainty