This is a preview. Log in through your library . Abstract This paper presents an algorithm, based on the simplex routine, that provides a way to solve a problem in which the objective function is not ...
This is a preview. Log in through your library . Abstract Traditional sensitivity analysis of linear programming objective function coefficients concerns itself with variations in single parameters.
This example shows how to use PROC LP to solve a linear goal-programming problem. PROC LP has the ability to solve a series of linear programs, each with a new objective function. These objective ...
In this paper, the authors are aimed at applying duality theory to multi-objective linear programming problems. Three methods of solutions were discussed and applied in this paper with the sole aim of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results