Abstract
For the one linear-fractional network programming problem with additional constraints of general kind and with inexact data we constructed a mathematical model for calculation of the new parameters of the restrictions for which the infeasible solution becomes feasible solution. For the selected feasible solution of this problem we minimally changed the parameters in the numerator of the linear-fractional objective function in order that the selected feasible solution has become an optimal. The measure proximity vectors estimated are using the norm l1. That has allowed to remain within the framework of linear programming in solving of inverse problems.
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 callMore From: International Journal of Pure and Apllied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
