JavaScript is disabled for your browser. Some features of this site may not work without it.

## Geometric Optimization and Computational Complexity

dc.contributor.author | Bajaj, Chanderjit | en_US |

dc.date.accessioned | 2007-04-23T16:52:45Z | |

dc.date.available | 2007-04-23T16:52:45Z | |

dc.date.issued | 1984-08 | en_US |

dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-629 | en_US |

dc.identifier.uri | https://hdl.handle.net/1813/6468 | |

dc.description.abstract | Our purpose here is to study problems involving geometric optimization, namely, questions of the type: Is there at least a minimum or at most a maximum number of certain geometric figures, that are within certain distances of other figures (objects). We are also concerned with the optimization of the size of these geometric figures. These problems arise as geometric reductions from various classes of location-allocation optimization problems and are inherently not pure combinatorial. Our primary aim, then, is to discover techniques of dealing with such geometric optimization problems, while adapting to these problems the older combinatorial design and analysis methods. The task of classifying problems accurately in the polynomial hierarchy is one of increasing importance. To solve an optimization problem deterministically it seems that one must solve both an $NP$ and a $Co-NP$ problem. The significance of the classes $NP$ and $Co-NP$ are that none of the problems they include is known to have a polynomial time solution. We show that if $NP \neq Co-NP$ then there are interesting natural geometric optimization problems (location-allocation problems under minsum) in $\Delta^{P}_{2}$ that are in neither $NP$ nor $Co-NP$. Hence, all these problems are shown to belong properly to $\Delta^{P}_{2}$, the second level of the polynomial hierarchy. We also show that if $NP \neq Co-NP$ then there are again some interesting geometric optimization problems (location-allocation problems under minmaz) properly in $\Delta^{P}_{2}$ and furthermore they are complete for a class $D^{P}$ (which is contained in $\Delta^{P}_{2}$ and contains $NP \bigcup Co-NP$). Also considered are the above geometric location-allocation optimization problems for the case when the allocation is predetermined. Both efficient algorithms and worst-case lower bounds are derived. Necessary conditions for the existence of mazima and minima in optimization problems are generally tied to the question of solvability of an equation or a system of equations. In calculus these equations are algebraic. By generating the minimal polynomial whose root over the field of rational numbers is the solution of the geometric optimization problem on the real (Euclidean) plane, we are able to prove the non-solvability of certain geometric optimization problems by radicals. The algebraic degree of the optimizing solution, which is the degree of the irreducible minimal polynomial for the problem, correlates with the inherent difficulty of constructing the solution and provides an algebraic complexity measure for these geometric optimization problems. | en_US |

dc.format.extent | 3290776 bytes | |

dc.format.extent | 1466897 bytes | |

dc.format.mimetype | application/pdf | |

dc.format.mimetype | application/postscript | |

dc.language.iso | en_US | en_US |

dc.publisher | Cornell University | en_US |

dc.subject | computer science | en_US |

dc.subject | technical report | en_US |

dc.title | Geometric Optimization and Computational Complexity | en_US |

dc.type | technical report | en_US |