Abstract:
This article discusses linear programming solutions and sensitivity analysis. The
method used is an iterative method, which is modified from Rosen’s gradient projection
method. This discussion aims to find the optimal solution by tracing the
points in the feasible region, and sensitivity analysis on changes in the coefficient
of the objective function to obtain the range of optimal parameters in the optimal
solution. Thus the problem that is disturbed can be conditioned to remain optimal.
This is a review of the Tantawy’s article, [Trends in Applied Sciences Research, 14
(2019), 7-11].