Abstract
Abstract This study intends to generalize the concept of maximal volume in the tolerance region for characterizing the perturbations of one column or one row of the constraint matrix in a standard linear programming problem. The Maximal Volume Region, recently proposed by Wang and Huang, is a symmetrically rectangular parallelepiped with the largest volume in a tolerance region over which different parameters with different levels of sensitivity can be conceived and handled simultaneously, independently and with the greatest flexibility. However, the defined Maximal Volume Region does not exist when perturbation occurs in a constraint matrix. Therefore, in this study, we investigate this case from its basic properties and structure with numerical illustrations.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
