Abstract
An interval maximum-entropy method for a kind of unconstrained min-max-min problem is described, where the constituent objective functions are C1. We transform this problem into a differentiable optimization problem using the maximum-entropy function, discuss the interval extension of the maximum-entropy function, prove relevant properties and provide several region deletion rules. An interval maximum-entropy algorithm is proposed, with a proof of convergence provided. Theoretical analysis and numerical results indicate that the new method is reliable and effective.
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.
