• Title/Summary/Keyword: Modified Linear Programming

Search Result 61, Processing Time 0.029 seconds

Optimum design of prestressed concrete beams by a modified grid search method

  • Cagatay, Ismail H.;Dundar, Cengiz;Aksogan, Orhan
    • Structural Engineering and Mechanics
    • /
    • v.15 no.1
    • /
    • pp.39-52
    • /
    • 2003
  • A computer program has been developed for the optimum design of prestressed concrete beams under flexure. Optimum values of prestressing force, tendon configuration, and cross-sectional dimensions are determined subject to constraints on the design variables and stresses. 28 constraints have been used including flexural stresses, cover requirement, the aspect ratios for top and bottom flanges and web part of a beam and ultimate moment. The objective function contains cost of concrete, prestressing force and formwork. Using this function, it is possible to obtain minimum cost design, minimum weight or cross-sectional area of concrete design and minimum prestressing force design. Besides the idealized I-shaped cross-section, which is widely used in literature, a general I-shaped cross-section with eight geometrical design variables are used here. Four examples, one of which is available in the literature and the others are modified form of it, have been solved for minimum cost and minimum cross-sectional area designs and the results are compared. The computer program, which employs modified grid search optimization method, can assist a designer in producing efficient designs rapidly and easily. Considerable savings in computational work are thus made possible.

Development of a gate Operation Model for Agricultural reservoirs (農業用 貯水池 水門 操作 模型 開發)

  • Chung, Sang-Ok
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.34 no.2
    • /
    • pp.40-48
    • /
    • 1992
  • A model using a linear programming technique was developed to operate gates for the optimum management of small of medium size agricultural reservoirs. To predict the inflow into the reservoirs the WASHMO model, which was a single event hydrology model, was modified and used. To test the applicability, the developed model was applied to two reservoirs located in Kyungpook province. The results showed that the model could be used for the optimum gate operation of the agricultural reservoirs.

  • PDF

Option of Network Flow Problem Considering Uncertain Arc Capacity Constraints (불확실한 arc용량제약식들을 고려한 네트워크문제의 최적화)

  • 박주녕;송서일
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.21
    • /
    • pp.51-60
    • /
    • 1990
  • In this paper we deal with the miniaml cost network flow problem with uncertain arc capacity constraints. When the arc capacities are fuzzy with linear L-R type membership function, using parametric programming procedure, we reduced it to the deterministic minimal cost network flow problem which can be solved by various typical network flow algorithms. A modified Algorithm using the Out-of-kilter algorithm is developed.

  • PDF

A case study for the dispersion parameter modification of the Gaussian plume model using linear programming (Linear Programming을 이용한 가우시안 모형의 확산인자 수정에 관한 사례연구)

  • Jeong, Hyo-Joon;Kim, Eun-Han;Suh, Kyung-Suk;Hwang, Won-Tae;Han, Moon-Hee
    • Journal of Radiation Protection and Research
    • /
    • v.28 no.4
    • /
    • pp.311-319
    • /
    • 2003
  • We developed a grid-based Gaussian plume model to evaluate tracer release data measured at Young Gwang nuclear site in 1996. Downwind distance was divided into every 10m from 0.1km to 20km, and crosswind distance was divided into every 10m centering released point from -5km to 5km. We determined dispersion factors, ${\sigma}_y\;and\;{\sigma}_z$ using Pasquill-Gifford method computed by atmospheric stability. Forecasting ability of the grid-based Gaussian plume model was better at the 3km away from the source than 8km. We confirmed that dispersion band must be modified if receptor is far away from the source, otherwise P-G method is not appropriate to compute diffusion distance and diffusion strength in case of growing distance. So, we developed an empirical equation using linear programming. An objective function was designed to minimize sum of the absolute value between observed and computed values. As a result of application of the modified dispersion equation, prediction ability was improved rather than P-G method.

MINLP optimization of a composite I beam floor system

  • Zula, Tomaz;Kravanja, Stojan;Klansek, Uros
    • Steel and Composite Structures
    • /
    • v.22 no.5
    • /
    • pp.1163-1192
    • /
    • 2016
  • This paper presents the cost optimization of a composite I beam floor system, designed to be made from a reinforced concrete slab and steel I sections. The optimization was performed by the mixed-integer non-linear programming (MINLP) approach. For this purpose, a number of different optimization models were developed that enable different design possibilities such as welded or standard steel I sections, plastic or elastic cross-section resistances, and different positions of the neutral axes. An accurate economic objective function of the self-manufacturing costs was developed and subjected to design, resistance and deflection (in)equality constraints. Dimensioning constraints were defined in accordance with Eurocode 4. The Modified Outer-Approximation/Equality-Relaxation (OA/ER) algorithm was applied together with a two-phase MINLP strategy. A numerical example of the optimization of a composite I beam floor system, as presented at the end of this paper, demonstrates the applicability of the proposed approach. The optimal result includes the minimal produced costs of the structure, the optimal concrete and steel strengths, and dimensions.

Optimal Disassembly Sequencing with Sequence-Dependent Operation Times Based on the Directed Graph of Assembly States (작업시간이 순서 의존적인 경우 조립상태를 나타내는 유방향그래프를 이용한 최적 제품 분해순서 결정)

  • Kang, Jun-Gyu;Lee, Dong-Ho;Xirouchakis, Paul;Lambert, A.J.D.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.3
    • /
    • pp.264-273
    • /
    • 2002
  • This paper focuses on disassembly sequencing, which is the problem of determining the optimum disassembly level and the corresponding disassembly sequence for a product at its end-of-life with the objective of maximizing the overall profit. In particular, sequence-dependent operation times, which frequently occur in practice due to tool-changeover, part reorientation, etc, are considered in the parallel disassembly environment. To represent the problem, a modified directed graph of assembly states is suggested as an extension of the existing extended process graph. Based on the directed graph, the problem is transformed into the shortest path problem and formulated as a linear programming model that can be solved straightforwardly with standard techniques. A case study on a photocopier was done and the results are reported.

Study on the Development of an Optimal Hull Form

  • Cho Hee-Jong;Lee Gyoung-Woo;Youn Soon-Dong;Chun Ho-Hwan
    • Journal of Navigation and Port Research
    • /
    • v.29 no.7
    • /
    • pp.603-609
    • /
    • 2005
  • This paper presents the method for developing an optimum hull form with minimum wave resistance using SQP( sequential quadratic programming) as an optimization technique. The wave resistance is evaluated by a Rankine source panel method with non-linear free surface conditions and the ITTC 1957 friction line is used to predict the frictional resistance coefficient. The geometry of the hull surface is represented and modified using NURBS(Non-Uniform Rational B-Spline) surface patches. To verify the validity of the developed program the numerical calculations for Wigley hull and Series 60 Cb=0.6 hull are performed and the results obtained after the numerical calculations are compared with the initial hulls.

Development of an Optimum Hull Form for a Container Ship with Minimum Wave Resistance (최소 조파저항을 가지는 컨테이너선의 선형최적화 기법에 대한 연구)

  • 최희종;서광철;김방은;전호환
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.40 no.4
    • /
    • pp.8-15
    • /
    • 2003
  • This paper presents the method for developing an optimum hull form with minimum wave resistance using SQP(sequential quadratic programming) as an optimization technique. The wave resistance is evaluated by a Rankine source panel method with non-linear free surface conditions and the ITTC 1957 friction line is used to predict the frictional resistance coefficient. The geometry of the hull surface is represented and modified using B-spline surface patches. The optimization method is applied to Series 60 hull and KCS(KRISO 3600 TEU Container Ship). The obtained results prove that the method is appropriate for preliminary hull form design.

Optimum Design of Cantilever Retaining Wall (켄틸레버 옹벽의 최적 설계)

  • 김종옥
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.37 no.1
    • /
    • pp.90-99
    • /
    • 1995
  • In this study, the algorithm for the optimum design of cantilever retaining wall was de veloped and solved using Modified Method of Feasible Directions(MMFD), Sequential Linear Programming(SLP) and Sequential Quadratic Programming(SQP). The algorithm was applied to the optimum design of 3-different height cantilever re tairing walls. It was shown that even though the starting points and optimization strategies are dif- ferent, the objective function and optimum design variables converge to within a close range, and consequently the reliability and efficiency of the underlying optimum design algorithm can be verified. It is expected that the optimum design algorithm developed in this study can be utilized efficiently for the optimum design of any scale cantilever retaining wall. Using optimum design method, cantilever retaining wall will be designed more economi- cally and reasonably than using traditional design method.

  • PDF

Optimum Path Planning for Mechanical Manipulators (기계적 로보트팔을 위한 최적 경로 설계)

  • Kim, Tae-San;Bae, Jun-Kyung;Park, Chong-Kug
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.941-944
    • /
    • 1988
  • To assure a successful completion of an assigned task without interruption, the hand of mechnical manipulator often travels along a preplanned path. This paper presents a method of obtaining a time sechdule of velocities and acceleration along the path, under the constraints. Because of the involvement of a linear performance index and a largr number of nonlinear constraints, the "method of approximate programming (AMP)" is applied. To overcome the false solutions AMP is modified. To reduce the computing time, a "direct approximate programming algorithm (DAPA)" is developed.

  • PDF