Abstract
In this study, an iterative method is suggested for solving the problem in which the objective function is a sum of linear and linear fractional functions, where the constraint functions are in the form of inequalities. The proposed method is based mainly upon the conjugate gradient projection method which is applicable tosolve nonlinear programming problems involving linear constraints. The main idea behind this method is to move through the feasible region via a sequence of points in the direction that improves the value of the objective function. Since the earlier methods based on the vertex information may have difficulties as the problem size increases, our method appears to be less sensitive to the problem size. An example is given to clarify the developed theory and the proposed method
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
