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 14 of 14 for “"mathematical programs"”.
-
Constraint qualifications and stationarity concepts for mathematical programs with equilibrium constraints
… (CQ) and stationarity concepts for mathematical programs with equilibrium constraints (MPEC) is presented. It is demonstrated that all but the weakest CQ, Guignard CQ, are too strong for a discussion of MPECs. Therefore, MPEC variants of all the standard CQs are introduced and …
-
The extreme point mathematical programming problem
This dissertation deals with a class of nonconvex mathematical programs called Extreme Point Mathematical Programs (EPMP). These problems are generalizations of certain Integer Programming problems and also find their application in other nonconvex programs like the Concave Minimization problem. …
-
A hierarchical bottom-up, equation-based optimization design methodology
… both a broadband amplifier and mixer as mathematical programs (MP) and extracted Pareto-optimal (PO) [1-3] tradeoff surfaces. Abstracting these PO surfaces in place of the blocks at the system level, we have demonstrated a new hierarchical system design methodology. Furthermore, the …
-
Methods for Solving Generalized Systems of Inequalities With Application to Nonlinear Programming
… and finding Karush-Kuhn-Tucker points for mathematical programs.
-
Model-based robust and stochastic control, and statistical inference for uncertain dynamical systems
… are considered, as well as different mathematical formalisms for quantification of the effects of uncertainties in dynamical systems. For deterministic uncertain models and robust control, uncertainties are described as sets of unknowns and every element from a set is presumed to be …
-
Internal convex programming, orthogonal linear programming, and program generation procedures
… solution of a series of 2n real valued convex programs where n is the dimension of the space. The solution of an interval programming problem is an interval vector which contains all possible solutions to any real valued convex program which may be realized. Attempts to improve the efficiency …
-
Parameter and state model reduction for Bayesian statistical inverse problems
… solution of the resulting stochastic or robust mathematical programs. In this thesis we consider the first of these steps, solution of the statistical inverse problem, for partial differential equations (PDEs) parameterized by field quantities. When these field variables and forward models are …
-
Mixed-integer convex optimization for planning aggressive motions of legged robots over rough terrain
… Based on this insight, I formulate a pair of mathematical programs for planning highly dynamic motions for legged robots. The first is a mixed-integer convex program, specifically, a mixed-integer quadratic program (MIQP), that yields a sequence of footholds/handholds as well as center of mass …
-
Design of genetic regulatory networks
… first is based on direct transcription (DT) and mathematical programs with complementarity constraints (MPCCs). Since genetic regulatory networks are dynamic systems, DT is an appropriate optimization strategy, and is used to determine optimal network parameter values. An MPCC formulation is …
-
Optimal Evacuation Plans for Network Flows over Time Considering Congestion
… network. This phenomenon is commonly found in mathematical programs used for dynamic traffic assignment where the traffic is unrealistically held back in order to determine an optimum solution. Lastly, we propose additional constraints for the MILP that improve the computational performance by …
-
The performance of coevolutionary topologies in developing competitive tree manipulation strategies for symbolic regression
… approach to dynamically damage and repair programs mathematical programs (functions). We opt for mathematical functions instead of software due to their functional similarities and simpler syntax and semantics. We utilize symbolic regression (SR) as a framework to analyze the error …
-
Scheduling And Resource Allocation In Wireless Sensor Networks
<p>In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, …
-
Global solution to parametric complementarity constrained programs and applications in optimal parameter selection
… 1, Parametric Complementarity Constrained Programs-- a Review of Methodologies, summarizes the basic techniques that are used in the algorithms for solving the mathematical program with complementarity constraints (MPCC), which is also referred to as the mathematical program with …
-
Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing
… purpose lifting mechanisms for tightening the mathematical programming formulations associated with such minimax optimization problems. Next, we explore novel continuous nonconvex as well as lifted discrete formulations for the notoriously challenging class of job-shop scheduling problems with …