Wagner, T.C. and Papalambros, P.Y., 1993a, A General Framework for Decomposition Analysis in Optimal Design, Advances in Design Automation---1993,B.J. Gilmore (ed.), Vol. 2, ASME, New York, pp. 315---25.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the number of partitions. A design problem (and therefore its FDT) can be represented by an undirected, linear graph. This representation does not require a priori knowledge of input output relations or causality between variables. A simplified version of the graph representation employed by Wagner and Papalambros (1993) is used in the network reliability formulation of problem partitioning. Wagner and Papalambros assigned a clique to each variable, and proved the equivalence of disjoint partitions in the FDT and connected components in its graph representation. In a clique based representation, a clique connects ....

....from each subsystem so that the system solution will be a Pareto optimum of the subsystem solutions. The methodology proposed in (Krishnamachari and Papalambros 1997) mainly focuses on synthesizing optimal design problems (ODP) that can be solved by a primal hierarchical decomposition method (Wagner and Papalambros 1993). A block angular structure is first identified for the general design problem (GDP) which lacks a design objective. An ODP is then created that can be hierarchically decomposed based on this structure. Formally, a GDP is first cast into the form (5) that has a master problem and K subproblems ....

Wagner, T.C. and Papalambros, P.Y., 1993. "A General Framework for Decomposition Analysis in Optimal Design," ASME Design Automation Conference, DE--Vo l 6 5 --2, New York, pp. 315--25.

....by Dantzig and Wolfe has been extended and applied by others to solve a wide range of problems. Mesarovic et al. 1970) specify a general theory for coordination of hierarchical systems. They discuss various coordination strategies based on known two level mathematical programming approaches. Wagner and Papalambros (1993a, 1993b) and Michelena and Papalambros (1994, 1995) specify decomposition strategies for a two level mathematical programming approach to design large systems. These decomposition techniques attempt to partition a large problem into subproblems such that the resulting two level optimization ....

Wagner, T.C., and Papalammbros, P.Y., (1993). A general framework for decomposition analysis in optimal design, Advances in Design Automation, B.J. Gilmore (ed.), Vol. 2, ASME, New York, pp. 315-325.

....already partitioned problems for increased computational efficiency and robustness has been extensively studied in operations research, but not how to partition a model in the first place. A recent Manuscript No. 950502 3 N. Michelena and P. Papalambros review on the former topic can be found in Wagner (1993) and Wagner and Papalambros (1993a) Design researchers have studied decomposition for improving coordination and information transfer across multiple disciplines (Balling and Sobieszczanski Sobieski, 1994; Kroo et al. 1994) and for streamlining the design process (Eppinger et al. 1994; Kusiak ....

....problems for increased computational efficiency and robustness has been extensively studied in operations research, but not how to partition a model in the first place. A recent Manuscript No. 950502 3 N. Michelena and P. Papalambros review on the former topic can be found in Wagner (1993) and Wagner and Papalambros (1993a) Design researchers have studied decomposition for improving coordination and information transfer across multiple disciplines (Balling and Sobieszczanski Sobieski, 1994; Kroo et al. 1994) and for streamlining the design process (Eppinger et al. 1994; Kusiak and Wang, 1993; Rogers and ....

[Article contains additional citation context not shown here]

Wagner, T.C. and Papalambros, P.Y., 1993a, A General Framework for Decomposition Analysis in Optimal Design, Advances in Design Automation---1993,B.J. Gilmore (ed.), Vol. 2, ASME, New York, pp. 315---25.

....ensure the convergence of the algorithm for nonlinear constraints. Several researchers have proposed coordination strategies to exploit the structure of a problem associated with its decomposition. Reviews of optimization procedures that use decomposition are presented by Wagner and Papalambros [14] and SobieszczanskiSobieski and Haftka [13] Recently, Nelson and Papalambros [5] presented Sequentially Decomposed Programming as a globally convergent coordination scheme for hierarchic systems. Other promising coordination algorithms, including concurrent subspace optimization (CSSO) 12] and ....

T. Wagner and P. Papalambros. A general framework for decomposition analysis in optimal design. In B.J. Gilmore, editor, Advances in Design Automation, volume 2, pages 315--322, New York, 1993. ASME. 708 American Institute of Aeronautics and Astronautics

No context found.

Wagner, T., Papalambros, P., 1993a, "A General Framework for Decomposition Analysis in Optimal Design," Advances in Design Automation, ASME, DE-Vol. 65-2, pp. 315-325.

....coordination under linear equalityandinequality constraints. Several researchers have proposed coordination strategies to exploit the structure of a problem associated with its decomposition. Reviews of optimization procedures that use decomposition are presented by Wagner and Papalambros [27] and Sobieszczanski Sobieski and Haftka [25] Recently, Nelson and Papalambros [19] presented sequentially decomposed programming (SDP) as a globally convergent coordination scheme for hierarchic systems. Other promising coordination algorithms, including concurrent subspace optimization (CSSO) ....

T. Wagner and P.Papalambros. A general framework for decomposition analysis in optimal design. In B.J. Gilmore, editor, Advances in Design Automation, volume 2, pages 315--322, New York, 1993. ASME. 26

....use of most of these techniques in situations where causality between tasks is non existent or ill defined. Heuristics or personnel interview data are used to identify tears of dependence relations between tasks if the problem structure is not sequentially decomposable. Wagner and Papalambros [65, 66] used an undirected graph representation of the optimal design problem. Mathematical relations and design and state behavior variables are depicted by the vertices and edges of the graph, respectively. Identification of linking or coordinating variables y leads to independent design ....

....decomposition, Figure 1(b) a subspace optimization takes place in each subproblem. Bidirectional intervention between subproblems may exist and, in general, global sensitivities and model approximations provide the means to quantify influences of one subproblem on another. We refer the reader to [64 65] for a complete review of hierarchical and nonhierarchical coordination schemes. Michelena and Papalambros [41] have also modeled the decomposition problem as a network optimization problem. Mathematical relations are modeled as processing units of a communication network and design and ....

T.C. Wagner and P.Y. Papalambros, "A General Framework for Decomposition Analysis in Optimal Design," Advances in Design Automation--1993, B.J. Gilmore (ed.), Vol. 2, ASME, New York, pp. 315--25, 1993.

No context found.

Wagner, T. and Papalambros, P., "A general framework for decomposition analysis in optimal design," in Advances in Design Automation (Gilmore, B., ed.), vol. 2, (New York), pp. 315--

....use of most of these techniques in situations where causality between tasks is non existent or ill defined. Heuristics or personnel interview data are used to identify tears of dependence relations between tasks if the problem structure is not sequentially decomposable. Wagner and Papalambros [65, 66] used an undirected graph representation of the optimal design problem. Mathematical relations and design and state variables are depicted by the vertices and edges of the graph, respectively. Identification of linking or coordinating variables y leads to independent design subproblems that ....

T.C. Wagner and P.Y. Papalambros, "A General Framework for Decomposition Analysis in Optimal Design," Advances in Design Automation--1993, B.J. Gilmore (ed.), Vol. 2, ASME, New York, pp. 315--25, 1993.

....OMBD problem and of the attendant large scale optimal design one. How to solve already partitioned problems for increased computational efficiency and robustness has been extensively studied in operations research but not how to partition a model in the first place. A recent review can be found in Wagner (1993) and Wagner and Papalambros (1993a) Design researchers have studied decomposition for improving coordination and information transfer across multiple disciplines (Balling and Sobieszczanski Sobieski, 1994; Kramer et al. 1994; Kroo et al. 1994) and for streamlining the design process (Eppinger ....

....the attendant large scale optimal design one. How to solve already partitioned problems for increased computational efficiency and robustness has been extensively studied in operations research but not how to partition a model in the first place. A recent review can be found in Wagner (1993) and Wagner and Papalambros (1993a) Design researchers have studied decomposition for improving coordination and information transfer across multiple disciplines (Balling and Sobieszczanski Sobieski, 1994; Kramer et al. 1994; Kroo et al. 1994) and for streamlining the design process (Eppinger et al. 1992, 1994; Kusiak and ....

[Article contains additional citation context not shown here]

Wagner, T.C. and Papalambros, P.Y., 1993a, "A General Framework for Decomposition Analysis in Optimal Design," Advances in Design Automation--1993, B.J. Gilmore (ed.), Vol. 2, ASME, New York, pp. 315--25.

....problem and of the attendant large scale optimal design one. How to solve already partitioned problems for increased computational efficiency and robustness has been extensively studied in operations research, but not how to partition a model in the first place. A recent review can be found in Wagner (1993) and Wagner and Papalambros (1993a) Design researchers have studied decomposition for improving coordination and information transfer across multiple disciplines (Balling and SobieszczanskiSobieski, 1994; Kroo et al. 1994) and for streamlining the design process (Eppinger et al. 1994; Kusiak ....

....the attendant large scale optimal design one. How to solve already partitioned problems for increased computational efficiency and robustness has been extensively studied in operations research, but not how to partition a model in the first place. A recent review can be found in Wagner (1993) and Wagner and Papalambros (1993a) Design researchers have studied decomposition for improving coordination and information transfer across multiple disciplines (Balling and SobieszczanskiSobieski, 1994; Kroo et al. 1994) and for streamlining the design process (Eppinger et al. 1994; Kusiak and Wang, 1993; Rogers and ....

[Article contains additional citation context not shown here]

Wagner, T.C. and Papalambros, P.Y., 1993a, "A General Framework for Decomposition Analysis in Optimal Design," Advances in Design Automation--1993, B.J. Gilmore (ed.), Vol. 2, ASME, New York, pp. 315--25.

....incidence matrices, respectively. They also proposed a branch and bound algorithm to identify overlapping design tasks or variables whose removal makes a design incidence matrix decomposable. Kroo used genetic algorithms to arrange design tasks and to decompose the problem. Wagner and Papalambros [37], 38] used an undirected graph representation of the design problem. Design relations and design and state variables are related to the vertices and edges of the graph, respectively. Identification of linking or coupling variables y leads to independent design subproblems that correspond to ....

T. C. Wagner and P. Y. Papalambros, A general framework for decomposition analysis in optimal design, in Advances in Design Automation--1993, B. J. Gilmore, ed., vol. 2, New York, 1993, ASME, pp. 315--325.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC