Abstract
Purpose – This paper presents an efficient algorithm for solving general constrained optimization problems that arise in operational research (OR).Design/methodology/approach – An unified approach is accomplished by converting the constrained optimization problem into an unconstrained one and by using Alienor method coupled to the new optimization preserving operator* (OPO*) technique for the resolution.Findings – A new algorithm for solving general constrained optimization problems with continuous objective function contributes to research in this area and in particular, to applications to OR.Research limitations/implications – Some improvements could probably be obtained at calculation time. We will in future work, develop an adaption of these methods and techniques to optimization problems with mixed variables or with integer and Boolean variables.Practical implications – The new algorithm can be advantageously compared with other methods such as generalized reduced gradient. Small‐sized numerical exam...
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.
