• Title/Summary/Keyword: Nonlinear Programming Problem

Search Result 273, Processing Time 0.027 seconds

A Study on Updating of Analytic Model of Dynamics for Aircraft Structures Using Optimization Technique (최적화 기법을 이용한 비행체 구조물 동특성 해석 모델의 최신화 연구)

  • Lee, Ki-Du;Lee, Young-Shin;Kim, Dong-Soo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.37 no.2
    • /
    • pp.131-138
    • /
    • 2009
  • Analytical modal verification is considered as the process to provide an acceptable description of the subject structure's behaviour. In general, results of original analytical model are different with actual structure results to uncertainty like non-linearity of material, boundary and modified shape, etc. In this paper, the dynamic model of glider's wing is correlated with static deformation and vibration test results by goal-attainment method, multi-objects optimization technique. The structural responses are predicted by using finite element method and optimization is carried out by using the SQP(sequential quadratic programming) method which is widely used in the constrained nonlinear optimization problem. The MAC(Modal Assurance Criterion) is used to modify the mode shapes and quantify the similarity.

3-D Optimal Disposition of Direction Finders (방향탐지장비의 삼차원 최적 배치)

  • Lee, Ho-Joo;Kim, Chang-Geun;Kang, Sung-Su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.765-772
    • /
    • 2011
  • In this paper, a simulation-based method is presented to dispose direction finders in three dimensional space for locating targets using the directional data. A direction finder(DF) is a military weapon that is used to find locations of targets that emit radio frequencies by operating two or more DFs simultaneously. If one or more DFs are operated in the air, the accuracy of location estimation can be enhanced by disposing them in a better configuration. By extending the line method, which is a well-known algorithm for 2-D location estimation, into 3-D space, the problem of 3-D location estimation is defined as an nonlinear programming form and solved analytically. Then the optimal disposition of DFs is considered with the presented method in which methods of simulation and search technique are combined. With the suggested algorithm for 3-D disposition of DFs, regions in which targets exist can be effectively covered so that the operation effect of DF be increased.

Optimal Design of Nonuniform Transmission Lime Sections for Wide-Band Impedance Matching (광대역 임피이던스정합용 불균일군차선로의 최적설계)

  • 박송배
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.11 no.6
    • /
    • pp.38-43
    • /
    • 1974
  • A design problem is studied for a nonuniform transmission line (NUTL) section to be inserted between an arbitrary source impedance and an arbitary load impedance for the purpose of impedance matching or providing a minimum input reflection coefficient over a frequency ranee as wide as possible. A special class of NUTL's, yet comprehensive enough to include almost all smoothly varying lines, are considered. Power series expansions of the ABCD parameters of such lines are used in the calculation of the input reflection coefficient. The design problem is formulated as a nonlinear programming problem withnonlinear constraints and is solved by a combined use of the sequential unconstrained minimization technique and tile Fletcher-Powell method. As a result, a line section was obtained which shows a marked improvement over any one hitherto published as a wide-band impedance matching device.

  • PDF

Minimum-Time Attitude Reorientations of Three-Axis Stabilized Spacecraft Using Only Magnetic Torquers

  • Roh, Kyoung-Min;Park, Sang-Young;Choi, Kyu-Hong;Lee, Sang-Uk
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.8 no.2
    • /
    • pp.17-27
    • /
    • 2007
  • Minimum-time attitude maneuvers of three-axis stabilized spacecraft are presented to study the feasibility of using three magnetic torquers perform large angle maneuvers. Previous applications of magnetic torquers have been limited to spin-stabilized satellites or supplemental actuators of three axis stabilized satellites because of the capability of magnetic torquers to produce torques about a specific axes. The minimum-time attitude maneuver problem is solved by applying a parameter optimization method for orbital cases to verify that the magnetic torque system can perform as required. Direct collocation and a nonlinear programming method with a constraining method by Simpson's rule are used to convert the minimum-time maneuver problems into parameter optimization problems. An appropriate number of nodes is presented to find a bang-bang type solution to the minimum-time problem. Some modifications in the boundary conditions of final attitude are made to solve the problem more robustly and efficiently. The numerical studies illustrate that the presented method can provide a capable and robust attitude reorientation by using only magnetic torquers. However, the required maneuver times are relatively longer than when thrusters or wheels are used. Performance of the system in the presence of errors in the magnetometer as well as the geomagnetic field model still good.

A Design for Integrated Logistics System with Inventory Control and Transportation Planning Problem (재고와 수송계획문제를 고려한 통합물류시스템 설계)

  • 우태희;조남호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.48
    • /
    • pp.37-52
    • /
    • 1998
  • In many distribution systems important cost reductions and/or service improvements may be achieved by adopting an efficient inventory policy and proper selection of facilities. These efficiency improvements and service enhancements clearly require an integrated approach towards various logistical planning functions. The areas of inventory control and transportation planning need to be closely coordinated. The purpose of this paper is to construct an integrated model that can minimize the total cost of the transportation and inventory systems between multiple origin and destination points, where in origin point i has the supply of commodities and in destination point j requires the commodities. In this case, demands of the destination points are assumed random variables which have a known probability distribution. Using the lot-size reorder-point policy and the safety stock level that minimize total cost we find optimal distribution centers which transport the commodities to the destination points and suggest an optimal inventory policy to the selected distribution center. We also show if a demand greater than one unit will occur at a particular time, we describe the approximate optional replenishment policy from computational results of this lot-size reorder-point policy. This model is formulated as a 0-1 nonlinear integer programming problem. To solve the problem, this paper proposes heuristic computational procedures and a computer program with UNIX C language. In the usefulness review, we show the meaning and validity of the proposed model and exhibit the results of a comparison between our approach and the traditional approach, respectively.

  • PDF

A Study on the Comparison of Performances Between Direct Method and Approximation Method in Structural Optimization (구조최적설계시 직접법 및 근사법 알고리즘의 성능 비교에 관한 연구)

  • 박영선;이상헌;박경진
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.2
    • /
    • pp.313-322
    • /
    • 1994
  • Structural optimization has been developed by two methods. One is the direct method which applies the Nonlinear Programming (NLP) algorithm directly to the structural optimization problem. This method is known to be very excellent mathematically. However, it is very expensive for large-scale problems due to the one-dimensional line search. The other method is the approximation method which utilizes the engineering senses very well. The original problem is approximated to a simple problem and an NLP algorithm is adopted for solving the approximated problems. Practical solutions are obtained with low cost by this method. The two methods are compared through standard structural optimization problems. The Finite element method with truss and beam elements is used for the structural and sensitivity analyses. The results are analyzed based on the convergence performances, the number is function calculations, the quality of the cost functions, and etc. The applications of both methods are also discussed.

Joint resource optimization for nonorthogonal multiple access-enhanced scalable video coding multicast in unmanned aerial vehicle-assisted radio-access networks

  • Ziyuan Tong;Hang Shen;Ning Shi;Tianjing Wang;Guangwei Bai
    • ETRI Journal
    • /
    • v.45 no.5
    • /
    • pp.874-886
    • /
    • 2023
  • A joint resource-optimization scheme is investigated for nonorthogonal multiple access (NOMA)-enhanced scalable video coding (SVC) multicast in unmanned aerial vehicle (UAV)-assisted radio-access networks (RANs). This scheme allows a ground base station and UAVs to simultaneously multicast successive video layers in SVC with successive interference cancellation in NOMA. A video quality-maximization problem is formulated as a mixed-integer nonlinear programming problem to determine the UAV deployment and association, RAN spectrum allocation for multicast groups, and UAV transmit power. The optimization problem is decoupled into the UAV deployment-association, spectrum-partition, and UAV transmit-power-control subproblems. A heuristic strategy is designed to determine the UAV deployment and association patterns. An upgraded knapsack algorithm is developed to solve spectrum partition, followed by fast UAV power fine-tuning to further boost the performance. The simulation results confirm that the proposed scheme improves the average peak signal-to-noise ratio, aggregate videoreception rate, and spectrum utilization over various baselines.

Inelastic vector finite element analysis of RC shells

  • Min, Chang-Shik;Gupta, Ajaya Kumar
    • Structural Engineering and Mechanics
    • /
    • v.4 no.2
    • /
    • pp.139-148
    • /
    • 1996
  • Vector algorithms and the relative importance of the four basic modules (computation of element stiffness matrices, assembly of the global stiffness matrix, solution of the system of linear simultaneous equations, and calculation of stresses and strains) of a finite element computer program for inelastic analysis of reinforced concrete shells are presented. Performance of the vector program is compared with a scalar program. For a cooling tower problem, the speedup factor from the scalar to the vector program is 34 for the element stiffness matrices calculation, 25.3 for the assembly of global stiffness matrix, 27.5 for the equation solver, and 37.8 for stresses, strains and nodal forces computations on a Gray Y-MP. The overall speedup factor is 30.9. When the equation solver alone is vectorized, which is computationally the most intensive part of a finite element program, a speedup factor of only 1.9 is achieved. When the rest of the program is also vectorized, a large additional speedup factor of 15.9 is attained. Therefore, it is very important that all the modules in a nonlinear program are vectorized to gain the full potential of the supercomputers. The vector finite element computer program for inelastic analysis of RC shells with layered elements developed in the present study enabled us to perform mesh convergence studies. The vector program can be used for studying the ultimate behavior of RC shells and used as a design tool.

A study on the optimization of network resource allocation scheme based on access probabilities (접근확률 기반의 네트워크 자원할당방식의 최적화에 관한 연구)

  • Kim Do-Kyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1393-1400
    • /
    • 2006
  • This paper optimizes the access probabilities (APs) in a network resource allocation scheme based on access probabilities in order that the waiting time and the blocking probability are minimized under the given constraints, and obtains its performance. In order to optimize APs, an infinite number of balance equations is reduced to a finite number of balance equations by applying Neuts matrix geometric method. And the nonlinear programming problem is converted into a linear programming problem. As a numerical example, the performance measures of waiting time and blocking probability for optimal access probabilities and the maximum utilization under the given constraints are obtained. And it is shown that the scheme with optimal APs gives more performance build-up than the strategy without optimization.

Stabilization and trajectory control of the flexible manipulator with time-varying arm length

  • Park, Chang-Yong;Ono, Toshiro;Sung, Yulwan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.20-23
    • /
    • 1996
  • This paper deals with the flexible manipulator with rotational and translational degrees of freedom, which has an arm of time-varying length with the prismatic joint. The tracking control problem of the flexible manipulator is considered. First we design the controller of the 2-type robust servo system based on the finite horizon optimal control theory for the trajectory planned as a discontinuous velocity. Next, to reduce the tracking error, we use the method of the dynamic programming and of modifying the reference trajectory in time coordinate. The simulation results show that the dynamic modeling is adequate and that the asymptotic stabilization of the flexible manipulator is preserved in spite of nonlinear terms. The PTP control error has been reduced to zero completely, and the trajectory tracking errors are reduced sufficiently by the proposed control method.

  • PDF