Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaves 172-179). Also available via the Internet.

Report (M.S.)--Virginia Polytechnic Institute and State University. M.S. 1993. / Abstract. Includes bibliographical references (leaves 103-105). Also available via the Internet.

see document / Master of Science

Approved for public release; distribution is unlimited. / We model the minimum-cost procurement and allocation of anti-ship cruise missiles to naval combat ships as a two-period stochastic integer program. Discrete scenarios in two periods define "demands" for missiles (i.e., targets and number of missiles required to kill those targets), which must be met with sufficiently high probabilities. After the former combat period, ships may replenish their inventories from a depot if desired and if the available depot inventory suffices. A force commander optimizes ship-to-target assignments to meet demands. The basic model solves slowly, so we add constraints to enforce reasonable operational directives, and add valid inequalities. These improvements reduce the solution time by 95% for the test case. Instances with up to six ships and five scenarios in each period then solve in less than one hour on a 2 GHz personal computer. / Lieutenant Commander, Israel Navy

This research was conducted in association with Naval Warfare Development Command (NWDC) requests to update Unmanned Vehicle Tactical Memorandum TM-3-22- 5-SW. The research identified and discussed significant USV manning considerations such as source ratings and manpower qualities to pilot, operate sensors, support USV electronics, and the manpower implications associated with various weapons systems alternatives. In addition, this research described several existing and notional USV tactics, as well as a discussion about the existing N75 and N76 primary and secondary mission areas USV operations may support. The methodology consisted of a literature review of USV test reports; USV Advanced Concept Technology Demonstration briefs; USV Concept of Operations; fleet lessons learned; the USV tactical memorandum; Naval manpower instructions, and manuals; Weapons Tactical, Field, and Training Manuals; Military Utility Assessments; search of books, magazines, and manpower theses. The research found that determining manpower qualities and standard operating procedures will remain a dynamic process until USV equipment is standardized. The research also showed USV launch and recovery is more manpower intensive than that of a standard RHIB. Gunners Mates (GM) and Aviation Ordnancemen (AO) are potential source ratings to support USV Hellfire and Javelin missile modules. The Navy should establish a GM Navy Enlisted Classification (NEC) to support Hellfire and Javelin or add these weapons to existing GM NECs. Electronics Technicians (ET), Fire Controlmen (FC), and Fire Control Technicians (FT) are potential source ratings for USV electrical/electronic support. FC and FT are potential source ratings to support the Remote Operated Small Arms Mount. This research found additional warfighting capabilities can be gained by equipping surface warfare vessels with USV's without any negative effects to primary or secondary warfare missions. Overall, USVs enhanced designed capabilities of Naval warships and directly support a capabilities based Navy.

Thesis (M.S. in Systems Technology (Space Systems Operations)--Naval Postgraduate School, September 1990. / Thesis Advisor(s): Jones, Carl R. Second Reader: Boger, Dan C. "September 1990." Description based on title screen as viewed on December 17, 2009. DTIC Identifier(s): Combat Support, Space Based, Space Warfare, Ground Based, NSWA(National Space Warfighting Architecture), Architecture, Reconnaissance, Strategic Reconnaissance, Space Surveillance, Warfighting Capabilities, Tactical Warfare, Naval Warfare, Space Systems, Missions, Theses. Author(s) subject terms: Space Warfare, Space-based Combat Support, Space Warfighting Architecture. Includes bibliographical references (p. 183-188). Also available in print.

Report (M.S.)--Virginia Polytechnic Institute and State University. M.S. 1992. / Vita. Abstract. Includes bibliographical references (leaves 135-136). Also available via the Internet.

Thesis (M.S. in Management)--Naval Postgraduate School, December 1990. / Thesis Advisor(s): Crawford, Alice ; Roberts, Benjamin. "December 1990." Description based on title screen as viewed on March 31, 2010. DTIC Identifier(s): Leadership Training, Management Planning And Control, Officer Personnel, Naval Personnel, Naval Warfare, Quality Control, TQM (Total Quality Management), Quality Management, TQM, Total Quality Management, Theses. Author(s) subject terms: Total Quality Leadership, Leadership, Management and Education Training, Command Excellence Program. Includes bibliographical references (p. 91-95). Also available in print.

This research deals with a study of the polyhedral structure of three important combinatorial optimization problems, namely, the generalized upper bounding (GUS) constrained knapsack problem, the set partitioning problem, and the quadratic zero-one programming problem, and applies related techniques to solve a practical combinatorial naval defense problem. In Part I of this research effort, we present new results on the polyhedral structure of the foregoing combinatorial optimization problems. First, we characterize a new family of facets for the GUS constrained knapsack polytope. This family of facets is obtained by sequential and simultaneous lifting procedures of minimal GUS cover inequalities. Second, we develop a new family of cutting planes for the set partitioning polytope for deleting any fractional basic feasible solutions to its underlying linear programming relaxation. We also show that all the known classes of valid inequalities belong to this family of cutting planes, and hence, this provides a unifying framework for a broad class of such valid inequalities. Finally, we present a new class of facets for the boolean quadric polytope, obtained by applying a simultaneous lifting procedure. The strong valid inequalities developed in Part I, such as facets and cutting planes, can be implemented for obtaining exact and approximate solutions for various combinatorial optimization problems in the context of a branch-and-cut procedure. In particular, facets and valid cutting planes developed for the GUS constrained knapsack polytope and the set partitioning polytope can be directly used in generating tight linear programming relaxations for a certain scheduling polytope that arises from a combinatorial naval defense problem. Furthermore, these tight formulations are intended not only to develop exact solution algorithms, but also to design powerful heuristics that provide good quality solutions within a reasonable amount of computational effort. Accordingly, in Part ll of this dissertation, we present an application of such polyhedral results in order to construct effective approximate and exact algorithms for solving a naval defense problem. tn this problem, the objective is to schedule a set of illuminators in order to strike a given set of targets using surface-to-air missiles in naval battle-group engagement scenarios. The problem is conceptualized as a production floor shop scheduling problem of minimizing the total weighted flow time subject to time-window job availability and machine-downtime unavailability side constraints. A polynomial-time algorithm is developed for the case when ail the job processing times are equal (and unity without loss of generality) and the data are all integer. For the general case of scheduling jobs with unequal processing times, we develop three alternative formulations and analyze their relative strengths by comparing their respective linear programming relaxations. The special structures inherent in a particular strong zero-one integer programming model of the problem enable us to derive some classes of strong valid inequalities from the facets of the GUB constrained knapsack polytope and the set-packing polytope. Furthermore, these special structures enable us to construct several effective approximate and exact algorithms that provide solutions within specified tolerances of optimality, with an effort that admits real-time processing in the naval battle-group engagement scenario. Computational results are presented using suitable realistic test data. / Ph. D.

Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990. / Thesis Advisor(s): Weir, Maurice D. ; Hughes, Wayne P. Second Reader: Lind, Judith. "September 1990." Description based on title screen as viewed on December 29, 2009. DTIC Identifier(s): Naval warfare, mathematical models, lessons learned. Author(s) subject terms: Naval combat models, combat theory, salvo warfare, human factors in combat models. Includes bibliographical references (p. 98). Also available in print.