Bicriteria Network Design Problems

We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a <subgraph \from a given subgraph-class that minimizes the second objective subject to the budget on the first. We consider three different criteria - the total edge cost, the diameter and the maximum degree of the network. Here, we present the first polynomial-time approximation algorithms for a large class of bicriteria network design problems for the above mentioned criteria. The following general types of results are presented. First, we develop a framework for bicriteria problems and their approximations. Second, when the two criteria are the same %(note that the cost functions continue to be different) we present a ``black box'' parametric search technique. This black box takes in as input an (approximation) algorithm for the unicriterion situation and generates an approximation algorithm for the bicriteria case with only a constant factor loss in the performance guarantee. Third, when the two criteria are the diameter and the total edge costs we use a cluster-based approach to devise a approximation algorithms --- the solutions output violate both the criteria by a logarithmic factor. Finally, for the class of treewidth-bounded graphs, we provide pseudopolynomial-time algorithms for a number of bicriteria problems using dynamic programming. We show how these pseudopolynomial-time algorithms can be converted to fully polynomial-time approximation schemes using a scaling technique.Comment: 24 pages 1 figur

On Generalizations of Network Design Problems with Degree Bounds

Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in the minimum spanning tree problem (namely, laminar crossing spanning tree), and (2) by incorporating `degree bounds' in other combinatorial optimization problems such as matroid intersection and lattice polyhedra. We give new or improved approximation algorithms, hardness results, and integrality gaps for these problems.Comment: v2, 24 pages, 4 figure

Flight telerobot mechanism design: Problems and challenges

Problems and challenges of designing flight telerobot mechanisms are discussed. Specific experiences are drawn from the following system developments: (1) the Force Reflecting Hand Controller, (2) the Smart End Effector, (3) the force-torque sensor, and a generic multi-degrees-of-freedom manipulator

Modeling the Structure and Complexity of Engineering Routine Design Problems

This paper proposes a model to structure routine design problems as well as a model of its design complexity. The idea is that having a proper model of the structure of such problems enables understanding its complexity, and likewise, a proper understanding of its complexity enables the development of systematic approaches to solve them. The end goal is to develop computer systems capable of taking over routine design tasks based on generic and systematic solving approaches. It is proposed to structure routine design in three main states: problem class, problem instance, and problem solution. Design complexity is related to the degree of uncertainty in knowing how to move a design problem from one state to another. Axiomatic Design Theory is used as reference for understanding complexity in routine design

Designing optimal mixtures using generalized disjunctive programming: Hull relaxations

A general modeling framework for mixture design problems, which integrates Generalized Disjunctive Programming (GDP) into the Computer-Aided Mixture/blend Design (CAMbD) framework, was recently proposed (S. Jonuzaj, P.T. Akula, P.-M. Kleniati, C.S. Adjiman, 2016. AIChE Journal 62, 1616–1633). In this paper we derive Hull Relaxations (HR) of GDP mixture design problems as an alternative to the big-M (BM) approach presented in this earlier work. We show that in restricted mixture design problems, where the number of components is fixed and their identities and compositions are optimized, BM and HR formulations are identical. For general mixture design problems, where the optimal number of mixture components is also determined, a generic approach is employed to enable the derivation and solution of the HR formulation for problems involving functions that are not defined at zero (e.g., logarithms). The design methodology is applied successfully to two solvent design case studies: the maximization of the solubility of a drug and the separation of acetic acid from water in a liquid-liquid extraction process. Promising solvent mixtures are identified in both case studies. The HR and BM approaches are found to be effective for the formulation and solution of mixture design problems, especially via the general design problem

Network growth model with intrinsic vertex fitness

© 2013 American Physical SocietyWe study a class of network growth models with attachment rules governed by intrinsic node fitness. Both the individual node degree distribution and the degree correlation properties of the network are obtained as functions of the network growth rules. We also find analytical solutions to the inverse, design, problems of matching the growth rules to the required (e.g., power-law) node degree distribution and more generally to the required degree correlation function. We find that the design problems do not always have solutions. Among the specific conditions on the existence of solutions to the design problems is the requirement that the node degree distribution has to be broader than a certain threshold and the fact that factorizability of the correlation functions requires singular distributions of the node fitnesses. More generally, the restrictions on the input distributions and correlations that ensure solvability of the design problems are expressed in terms of the analytical properties of their generating functions

Mechanical design problems associated with turbopump fluid film bearings

Most high speed cryogenic turbopumps for liquid propulsion rocket engines currently use ball or roller contact bearings for rotor support. The operating speeds, loads, clearances, and environments of these pumps combine to make bearing wear a limiting factor on turbopump life. An example is the high pressure oxygen turbopump (HPOTP) used in the Space Shuttle Main Engine (SSME). Although the HPOTP design life is 27,000 seconds at 30,000 rpms, or approximately 50 missions, bearings must currently be replaced after 2 missions. One solution to the bearing wear problem in the HPOTP, as well as in future turbopump designs, is the utilization of fluid film bearings in lieu of continuous contact bearings. Hydrostatic, hydrodynamic, and damping seal bearings are all replacement candidates for contact bearings in rocket engine high speed turbomachinery. These three types of fluid film bearings have different operating characteristics, but they share a common set of mechanical design opportunities and difficulties. Results of research to define some of the mechanical design issues are given. Problems considered include transient strat/stop rub, non-operational rotor support, bearing wear inspection and measurement, and bearing fluid supply route. Emphasis is given to the HPOTP preburner pump (PBP) bearing, but the results are pertinent to high-speed cryogenic turbomachinery in general