Abstract
This work presents a different computational way in finding optimal solutions of Integer-Programming problems under irregular data spaces. In addition, a real application on advertisement problems is given, where the maximum advertisement result is achieved with the minimum value of the risk probability of our campaign under limited resources. Graph theory, Metric Spaces, Taxonomy theory, Boolean algebra and principles of the General Catastrophe theory are used.
