A New Approach to Constrained Optimization

Gabriella Muratore


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 (space of -vectors) and constrained over a
generic subset and we will present numerical results when
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 .

[DOI: 10.1685/CSC06118] About DOI

Full Text:


DOI: https://doi.org/10.1685/

Creative Commons License   Except where otherwise noted, content on this site is
  licensed under a Creative Commons 2.5 Italy License