Abstract
A geometric programming problem subject to bipolar max-product fuzzy relation equation constraints is studied in this paper. Some necessary and sufficient conditions are given for its solution existence. A lower and upper bound on the solution set of its feasible domain is obtained. Some sufficient conditions are proposed to determine some its optimal components without its resolution. A modified branch-and-bound method is extended to solve the problem. Moreover, an efficient algorithm is proposed to solve the problem based on the simplification operations and the modified branch-and-bound method. Its computational complexity is carefully analyzed. Some examples are given to show the importance of the problem and to illustrate the process of the algorithm. Finally, an analytic and comparative study is done to show the efficiency of the simplification procedures.
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.
