A New Approach to Constrained Optimization

##article.authors##

  • Gabriella Muratore

##semicolon##

https://doi.org/10.1685/

##article.abstract##

In this paper we will present a new approach to constrained optimization based on the key idea of ordering the elements in appropriately chosen subspaces. The method will be detailed for the case in which the objective function is defined on S1_M5_Muratore0.png (space of S1_M5_Muratore1.png S1_M5_Muratore2.png-vectors) and constrained over a generic subset S1_M5_Muratore3.png and we will present numerical results when S1_M5_Muratore3.png is a polyhedron. These results will be compared with existing methods for integer programs. Future research will concentrate on improving the method efficiency for generic functions constrained on a generic set S1_M5_Muratore3.png. [DOI: 10.1685/CSC06118] About DOI

##submission.downloads##

##submissions.published##

2007-10-01

##issue.issue##

##section.section##

Articles