| Abstract: | ![]()
This paper is concerned with the solution of linear and linear goal programming problems in which the values of the right-hand side parameters are not fixed constants. Specifically, we are concerned with linear optimization problems in which the right-hand sides of the constraining equations are free to vary subject to a set of linear constraining equations. By formulating a relaxed linear program wherein the right-hand sides are treated as variables, we show how it is possible to solve one larger linear program that yields as a solution not only the optimal values for the decision variables, but also the optimal values for the right-hand sides. |
