No description available.

No description available.

Thesis (M.S.)--University of Akron, Dept. of Mathematics, 2007. / "May, 2007." Title from electronic thesis title page (viewed 4/28/2009) Advisor, Ali Hajjafar; Faculty readers, Linda Marie Saliga, Lala Krishna; Department Chair, Joseph W. Wilder; Dean of the College, Ronald F. Levant; Dean of the Graduate School, George R. Newkome. Includes bibliographical references.

Thesis (Ph.D.)--Memorial University of Newfoundland, 1999. / Bibliography: leaves 173-181.

No description available.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1979. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND AERONAUTICS. / Vita. / Includes bibliographical references. / by Woodrow Whitlow, Jr. / Ph.D.

When integer programming (IP) models are used in operational situations there is a need to consider the tradeoff between the conflicting goals of solution quality and solution time, since for many problems solving realistic-size instances to a tight tolerance is still beyond the capability of state-of-the-art solvers. However, by appropriately defining small instances, good primal solutions frequently can be found quickly. We explore this approach in this thesis by studying the design of algorithms that produce solutions to an integer program by solving restrictions of the problem via integer programming technology. We refer to this type of algorithm as IP-based search and present algorithms for network design problems of both real-world and academic interest. Along with algorithms that exploit the structure of the problem studied we also present a general integer programming algorithm that uses column generation to choose the restrictions to solve.

Thesis (Ph. D.)--Carnegie Mellon University, 2003. / Title from PDF title page (viewed Dec. 18, 2009). Includes bibliographical references (p. 49-52).

Integral equations arise in many scienti c and engineering problems. A large class of initial and boundary value problems can be converted to Volterra or Fredholm integral equations. The potential theory contributed more than any eld to give rise to integral equations. Integral equations also has signi cant application in mathematical physics models, such as di rac- tion problems, scattering in quantum mechanics, conformal mapping and water waves. The Volterra's population growth model, biological species living together, propagation of stocked sh in a new lake, the heat transfer and the heat radiation are among many areas that are described by integral equations. For limited applicability of analytical techniques, the numer- ical solvers often are the only viable alternative. General computational techniques of solving integral equation involve discretization and generates equivalent system of linear equations. In most of the cases the discretization produces dense matrix. Multigrid methods are widely used to solve partial di erential equation. We discuss the multigrid algorithms to solve integral equations and propose usages of distributive relaxation and the Kaczmarz method. / Department of Mathematical Sciences

Dans cette thèse, nous avons étudié les méthodes de régularisation pour la résolution numérique de problèmes avec équilibres. Dans une première partie, nous nous sommes intéressés aux problèmes de complémentarité au travers de deux applications : les équations en valeur absolue et les problèmes de parcimonie. Dans une seconde partie, nous avons étudié les problèmes d'optimisation sous contraintes de .complémentarité. Après avoir définies des conditions d'optimalité pour ces problèmes nous avons proposé une nouvelle méthode de régularisation appelée méthode des papillons. A partir d'une étude de la résolution des sous-problèmes de la régularisation nous avons défini un algorithme avec des propriétés de convergence forte. Tout au long de ce manuscrit nous nous sommes concentrés sur les propriétés théoriques des algorithmes ainsi que sur leurs applications numériques. La dernière partie de ce document est consacrée aux résultats numériques des méthodes de régularisation. / In this thesis, we studied the regularization methods for the numerical resolution of problems with equilibria. In the first part, we focused on the complementarity problems through two applications that are the absolute value equation and the sparse optimization problem. In the second part, we concentrated on optimization problems with complementarity constraints. After studying the optimality conditions of this problem, we proposed a new regularization method, so-called butterfly relaxation. Then, based on an analysis of the regularized sub-problems we defined an algorithm with strong convergence property. Throughout the manuscript, we concentrated on the theoretical properties of the algorithms as well as their numerical applications. In the last part of this document, we presented numerical results using the regularization methods for the mathematical programs with complementarity constraints.