• Title/Summary/Keyword: dual problem

Search Result 710, Processing Time 0.029 seconds

Optimal reinforcement design of structures under the buckling load using the homogenization design method

  • Min, Seungjae;Kikuchi, Noboru
    • Structural Engineering and Mechanics
    • /
    • v.5 no.5
    • /
    • pp.565-576
    • /
    • 1997
  • The material-based homogenization design method generates arbitrary topologies of initial structural design as well as reinforcement structural design by controlling the amount of material available. However, if a small volume constraint is specified in the design of Lightweight structures, thin and slender structures are usually obtained. For these structures stability becomes one of the most important requirements. Thus, to prevent overall buckling (that is, to increase stability), the objective of the design is to maximize the buckling load of a structure. In this paper, the buckling analysis is restricted to the linear buckling behavior of a structure. The global stability requirement is defined as a stiffness constraint, and determined by solving the eigenvalue problem. The optimality conditions to update the design variables are derived based on the sequential convex approximation method and the dual method. Illustrated examples are presented to validate the feasibility of this method in the design of structures.

Design of Satellite System for the Back-up System of Unmanned Control Plant

  • Chung, Kee-Heon;Yoon, Young-Hwan;Byun, Doo-Gyoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.170.4-170
    • /
    • 2001
  • Safety and confidence of the communications network is the main purpose for the unmanned control systems, in terms of appling a satellite communications network to the water treatment and supply plant communication system. Since the unmanned control systems were applied in the industrial site, the lack of confidence on the communications network has been presented continuously as a main problem for the unmanned and automation systems. Therefore, satellite communications network was presented as one of the methods to solve this problem, supporting the wire used telecommunication. In addition to the safety of a communications network, there is the retrenchment of expenditure. This dual communications network has ...

  • PDF

ON SUFFICIENCY AND DUALITY IN MULTIOBJECTIVE SUBSET PROGRAMMING PROBLEMS INVOLVING GENERALIZED $d$-TYPE I UNIVEX FUNCTIONS

  • Jayswal, Anurag;Stancu-Minasian, I.M.
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.111-125
    • /
    • 2012
  • In this paper, we introduce new classes of generalized convex n-set functions called $d$-weak strictly pseudo-quasi type-I univex, $d$-strong pseudo-quasi type-I univex and $d$-weak strictly pseudo type-I univex functions and focus our study on multiobjective subset programming problem. Sufficient optimality conditions are obtained under the assumptions of aforesaid functions. Duality results are also established for Mond-Weir and general Mond-Weir type dual problems in which the involved functions satisfy appropriate generalized $d$-type-I univexity conditions.

Modeling of fractional magneto-thermoelasticity for a perfect conducting materials

  • Ezzat, M.A.;El-Bary, A.A.
    • Smart Structures and Systems
    • /
    • v.18 no.4
    • /
    • pp.707-731
    • /
    • 2016
  • A unified mathematical model of the equations of generalized magneto-thermoelasticty based on fractional derivative heat transfer for isotropic perfect conducting media is given. Some essential theorems on the linear coupled and generalized theories of thermoelasticity e.g., the Lord- Shulman (LS) theory, Green-Lindsay (GL) theory and the coupled theory (CTE) as well as dual-phase-lag (DPL) heat conduction law are established. Laplace transform techniques are used. The method of the matrix exponential which constitutes the basis of the state-space approach of modern theory is applied to the non-dimensional equations. The resulting formulation is applied to a variety of one-dimensional problems. The solutions to a thermal shock problem and to a problem of a layer media are obtained in the present of a transverse uniform magnetic field. According to the numerical results and its graphs, conclusion about the new model has been constructed. The effects of the fractional derivative parameter on thermoelastic fields for different theories are discussed.

ADVANCED DOMAIN DECOMPOSITION METHOD BY LOCAL AND MIXED LAGRANGE MULTIPLIERS

  • Kwak, Junyoung;Chun, Taeyoung;Cho, Haeseong;Shin, Sangjoon;Bauchau, Olivier A.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.18 no.1
    • /
    • pp.17-26
    • /
    • 2014
  • This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.

Maximizing Network Utility and Network Lifetime in Energy-Constrained Ad Hoc Wireless Networks

  • Casaquite, Reizel;Hwang, Won-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.1023-1033
    • /
    • 2007
  • This study considers a joint congestion control, routing and power control for energy-constrained wireless networks. A mathematical model is introduced which includes maximization of network utility, maximization of network lifetime, and trade-off between network utility and network lifetime. The framework would maximize the overall throughput of the network where the overall throughput depends on the data flow rates which in turn is dependent on the link capacities. The link capacity on the other hand is a function of transmit power levels and link Signal-to-Interference-plus-Noise-Ratio (SINR) which makes the power allocation problem inherently difficult to solve. Using dual decomposition techniques, subgradient method, and logarithmic transformations, a joint algorithm for rate and power allocation problems was formulated. Numerical examples for each optimization problem were also provided.

A Dispatching Method for Automated Guided Vehicles to Minimize Delays of Containership Operations

  • Kim, Kap-Hwan;Bae, Jong-Wook
    • Management Science and Financial Engineering
    • /
    • v.5 no.1
    • /
    • pp.1-25
    • /
    • 1999
  • There is a worldwide trend to automate the handling operations in port container terminals in an effort to improve productivity and reduce labor cost. This study iscusses how to apply an AGV(automated guided vehicle) system to the handling of containers in the yard of a port container ter-minal. The main issue of this paper is how to assign tasks of container delivery to AGVs during ship operations in an automated port container terminal. A dual-cycle operation is assumed in which the loading and the discharging operation can be performed alternately. Mixed integer linear program-ming formulations are suggested for the dispatching problem. The completion time of all the dis-charging and loading operations by a quayside crane is minimized, and the minimization of the total travel time of AGVs is also considered as a secondary objective. A heuristic method using useful properties of the dispatching problem is suggested to reduce the computational time. The perfor-mance of the heuristic algorithm is evaluated in light of solution quality and computation time.

  • PDF

An efficent method of binocular data reconstruction

  • Rao, YunBo;Ding, Xianshu;Fan, Bojiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3721-3737
    • /
    • 2015
  • 3D reconstruction based on binocular data is significant to machine vision. In our method, we propose a new and high efficiency 3D reconstruction approach by using a consumer camera aiming to: 1) address the configuration problem of dual camera in the binocular reconstruction system; 2) address stereo matching can hardly be done well problem in both time computing and precision. The kernel feature is firstly proposed in calibration stage to rectify the epipolar. Then, we segment the objects in the camera into background and foreground, for which system obtains the disparity by different method: local window matching and kernel feature-based matching. Extensive experiments demonstrate our proposed algorithm represents accurate 3D model.

Eccentric Crack in a Piezoelectric Strip Under Electro-Mechanical Loading

  • Lee, Kang-Yong;Shin, Jeong-Woo;Kwon, Soon-Man
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.1
    • /
    • pp.21-25
    • /
    • 2001
  • We consider the problem of determining the singular stresses and electric fields in a piezoelectric ceramic strip containing a Griffith eccentric crack off the center line under anti-plane shear loading with the theory of linear piezoelectricity. Fourier transforms are used to reduce the problem to the solution of two pairs of dual integral equations, which are then expressed to a Fredholm integral equation of the second kind. Numerical values on the stress intensity factor and the energy release rate are obtained, and the influences of the electric fields for piezoelectric ceramics are discussed.

  • PDF

A Study on New Algorithm for K Shortest Paths Problem (복수최단경로의 새로운 해법 연구)

  • Chang ByungMan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.8-14
    • /
    • 2002
  • This article presents a new algorithm for the K Shortest Paths Problem which develops initial K shortest paths, and repeal to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution which comprises K shortest paths among shortest paths to traverse each arc is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, one inward arc of this crossing node, which has minimum detouring distance, is chosen, and a new path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. This algorithm, requires worst case time complexity of $O(Kn^2),\;and\;O(n^2)$ in the case $K{\leq}3$.

  • PDF