A new geometric approach for sensitivity analysis in linear programming
From MaRDI portal
Publication:6509133
DOI10.14708/MA.V49I2.7112arXiv2303.05757MaRDI QIDQ6509133FDOQ6509133
Authors: Mustapha Kaci, Sonia Radjef 
Abstract: In this paper, we present a new geometric approach for sensitivity analysis in linear programming that is computationally practical for a decision-maker to study the behavior of the optimal solution of the linear programming problem under changes in program data. First, we fix the feasible domain (fix the linear constraints). Then, we geometrically formulate a linear programming problem. Next, we give a new equivalent geometric formulation of the sensitivity analysis problem using notions of affine geometry which consists write the coefficient vector of the objective function in polar coordinate and determining all the angles for which the solution remains unchanged. Finally, the approach is presented in detail and illustrated with a numerical example.
This page was built for publication: A new geometric approach for sensitivity analysis in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509133)
