Physical Sciences and Mathematics Commons^™

Test Suite For Multiobjective Optimization And Results Using Normal Boundary Intersection (Nbi) In Design Explorer, Siva Kumar Natarajan

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Several methods have been developed to solve multiobjective optimization problems (MOP's). One of these, Normal Boundary Intersection (NBI), is a method developed by John Dennis and Indraneel Das. NBI is used at The Boeing Company as a tool to solve MOP's. This report presents a test suite of MOP's that I developed for Boeing during me internship in summer 2003.

The problems in the test suite were chosen to represent the different types of multiobjective optimization problems that could arise in practice and the complexities involved in solving them. These problems range from those that have nice convex Pareto surfaces …

Computer Simulation And Homogenization In Heating Design Optimization, Daniel K. Balls

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

The ability to ensure uniformity of temperature within a given finite physical region is an essential element in the success of many scientific processes, especially those that involve extreme fluctuation in temperature. Such a process is performed in an instrument called the LightTyper developed by Idaho Technology, Inc. of Salt Lake City Utah. This paper details the development and results of a scheme intended to obtain a heating design that ensures a high degree of temperature uniformity within the Idaho Technology instrument. Due to the experiments performed during this project, we were able to answer many questions that concerned finding …

On The Approximability Of Linear Ordering And Related Np-Optimization Problems., Sounaka Mishra Dr.

Doctoral Theses

We investigate approximability of both maximum and minimum linear ordering problems (MAX-LOP and MIN-LOP) and several related problems such as the well known feedback set problems, acyclie subdigraph problem and several others and their variants.We show that both MAX-LOP and MIN-LOP are strongly NP-complete, and MIN- LOP, MIN-QAP(S) (a special case of minimum quadratic assignment problem) and MIN-W-FAS are equivalent with respect to strict-reduction. The strict-equivalence is also established among these problems as well as MIN-W-FVS, with weights on arcs/vertices bounded by a polynomial, and the unweighted versions of the feedback set. problems. We also show that MAX-LOP is strict-equivalent …