Engineering Commons^™

Heterogeneous Air Defense Battery Location: A Game Theoretic Approach, Nicholas T. Boardman

Theses and Dissertations

The Unites States and its allies confront a persistent and evolving threat from missile attacks as nations around the world continue to invest and advance their current capabilities. Within the air defense context of a missile-and-interceptor engagement, a challenge for the defender is that surface to air interceptor missile batteries often must be located to protect high-value targets dispersed over a vast area, subject to an attacker observing the disposition of batteries prior to developing and implementing an attack plan. To model this scenario, we formulate a two-player, three-stage, perfect information, sequential move, zero-sum game that accounts for, respectively, a …

An Investigation Of Fast And Frugal Heuristics For New Product Project Selection, Fatima Mohammed Albar

Dissertations and Theses

In the early stages of new product development, project selection is dominantly based on managerial intuition, rather than on analytic approaches. As much as 90% of all product ideas are rejected before they are formally assessed. However, to date, little is known about the product screening heuristics and screening criteria managers use: it has been suggested that their decision process resembles the "fast and frugal" heuristics identified in recent psychological research, but no empirical research exists. A major part of the product innovation pipeline is thus poorly understood.

This research contributes to closing this gap. It uses cognitive task analysis …

The Multiobjective Average Network Flow Problem: Formulations, Algorithms, Heuristics, And Complexity, Jeremy D. Jordan

Theses and Dissertations

Integrating value focused thinking with the shortest path problem results in a unique formulation called the multiobjective average shortest path problem. We prove this is NP-complete for general graphs. For directed acyclic graphs, an efficient algorithm and even faster heuristic are proposed. While the worst case error of the heuristic is proven unbounded, its average performance on random graphs is within 3% of the optimal solution. Additionally, a special case of the more general biobjective average shortest path problem is given, allowing tradeoffs between decreases in arc set cardinality and increases in multiobjective value; the algorithm to solve the average …