Abstract
In this paper, a deterministic global optimization algorithm is proposed for solving min-max and max-min linear fractional programming problem (P) which have broad applications in engineering, management science, nonlinear system, economics and so on. By utilizing equivalent problem (Q) of the (P) and two-phase linear relaxation technique, the relaxation linear programming (RLP) about the (P) is established. The proposed algorithm is convergent to the global minimum of (P) through the successive refinement of the feasible region and solutions of a series of RLP. And finally the numerical examples are given to illustrate the feasibility of the presented algorithm.
Highlights
Summary
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Computational Intelligence Systems
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.
