Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 2313 for “"Mixed Integer"”.
-
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
… thesis we focus on solution methods for convex mixed-integer nonlinear optimization problems (MINLP). As one main result, we propose a new algorithm guaranteeing global optimality for convex MINLPs under standard assumptions. The new algorithm called MIQP-supported outer approximation (MIQPSOA) …
-
Mixed integer bilevel programming problems
This thesis presents the mixed integer bilevel programming problems where some optimality conditions and solution algorithms are derived. Bilevel programming problems are optimization problems which are partly constrained by another optimization problem. The theoretical part of this dissertation is …
-
Subadditive Approaches to Mixed Integer Programming
… (1975) and Klabjan (2007) for solving pure integer linear programming problems are studied. These algorithms rely on Gomory's corner relaxation and subadditive duality. Examples are given to demonstrate the failure of these algorithms on specific IPs and ways of correcting errors in some …
-
Topics in Mixed Integer Nonlinear Optimization
Mixed integer nonlinear optimization has many applications ranging from machine learning to power systems. However, these problems are very challenging to solve to global optimality due to the inherent non-convexity. This typically leads the problem to be NP-hard. Moreover, in many applications, …
-
ON THE COMPLEXITY OF MIXED INTEGER PROGRAMMING
We study the theoretical complexity of mixed integer programming algorithms. We first discuss the relative efficiency of branch and bound (BB) and cutting plane (CP) algorithms in different scenarios. We made the comparisons based on two concrete measures: number of iterations and sparsity of …
-
Maximum consensus with mixed integer linear programming
… consensus problem exactly in the context of Mixed Integer Linear Programming. In particular, two preprocessing techniques aimed at improving the speed and efficiency of exact methods are proposed.
-
Reducing mixed-integer to zero-one programs
… development of efficient algorithms for several integer optimization programs. Unfortunately, these programs are often not sufficient to represent the environment and thus real-life applications appropriate. This challenge can only be solved by using additionally continuous variables. Then, for …
-
Fundamental properties of convex mixed-integer programs
… of various fundamental concepts in convex mixed-integer programs (MIPs), that is, optimization problems where all the decision variables belong to a given convex set and, in addition, a subset of them are required to be integer. In particular, we study properties of their feasible region …
-
Mixed Integer Programming Approaches for Group Decision Making
… by formulating the decision-making problem as a mixed integer nonlinear program (MINLP), providing feedback by solving the MINLP in real-time, and allowing the general public to contribute their opinions. Since an interactive component is involved, it is the goal of this thesis to attempt to …
-
Mixed-integer optimal control of fast dynamical systems
… computer science and economics involve <em>mixed-integer optimal control problems</em>. Solving these problems in real-time is a challenging task because of the explosion of integer combinations to evaluate. This thesis focuses on the development of new algorithms for mixed-integer …
-
Automated Selected of Mixed Integer Program Solver Parameters
… solver parameter settings perform for classes of mixed integer programs. The use of experimental design facilitates fitting a model that describes the response surface across all combinations of parameter settings, even those not explicitly tested, allowing identification of both desirable and …
-
Algorithms for Multi-Objective Mixed Integer Programming Problems
… over the efficient set for bi-objective mixed integer linear programs. The second group includes an application of a special case of optimization over the efficient on conservation planning problems modeled with modern portfolio theory. Finally, the third group presents a machine learning …
-
Theory and Applications of Mixed-Integer Fractional Programming
… theoretical and practical results for a class of mixed-integer problems with fractional objectives. We introduce the generalized clique relaxation models with fractional objectives, namely the maximum ratio s-plex problem and the maximum ratio s-defective clique problem. We establish complexity …
-
Advanced underground mine scheduling using mixed integer programming
Includes bibliographical references (pages 107-111).
-
An Algorithm for Biobjective Mixed Integer Quadratic Programs
… and model important applications. Adding mixed-integer variables extends their applicability while the resulting programs become global optimization problems. Thus, in this work, we develop a branch and bound (BB) algorithm for solving biobjective mixed-integer quadratic programs …
-
Exact Algorithms for Mixed-Integer Multilevel Programming Problems
… contribute exact finite algorithms for bilevel mixed-integer programs, three-stage defender-attacker-defender problems, and two-stage stochastic programs. Moreover, we do not assume linearity or convexity for the last-stage problem and allow the existence of discrete variables. We demonstrate …
Page 1 of 116