Abstract
The parameter-uncertainty-interval-estimation (PIE) problem is transferred into several dual-linear-programming (DLP) problems, and a recursive DLP algorithm is proposed and applied in PIE. This recursive algorithm is based on a modified dual-simplex method that is specifically developed for solving the DLP problems derived from the PIE problem. Because the scale of the DLP problems is considerably smaller than that of the primal linear-programming problems for solving the PIE problem, the recursive DLP algorithm is computationally efficient and suitable for online-engineering applications. Simulations show the effectiveness of the proposed recursive algorithm.
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.
