• Title/Summary/Keyword: Mathematical Programming Approach

Search Result 119, Processing Time 0.024 seconds

Integrated mathematical programming Approach of Cell formation and facility layout in cellular manufacturing (셀형제조시스템에서 셀형성과 설비배치를 통합한 수리계획모형에 관한 연구)

  • Lee Sang-Wan;Kim Hae-Sik;Cho Sung-Youl
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.28 no.2
    • /
    • pp.94-100
    • /
    • 2005
  • This paper presents the application of integrated mathematical programming approach for the design of cellular manufacturing. The proposed approach is carried out in two phases The first phase concerning exceptional elements(EEs) in cell formation and the second phase facilities layout design. This paper considers the total costs of three important costs for (1) intercellular transfer (2) machine duplication and (3) subcontracting. One of Important issue is the calculation of the number of machines considering the maximum utilization of machines and the available capacity of a machines that can be transferred between cells. Facilities layout design is considered to reflect the real field data taking in to account the operational sequence of the parts to be manufactured. The model is formulated as mixed integer programming that is employed to find the optimal solution.

A METHOD USING PARAMETRIC APPROACH WITH QUASINEWTON METHOD FOR CONSTRAINED OPTIMIZATION

  • Ryang, Yong-Joon;Kim, Won-Serk
    • Bulletin of the Korean Mathematical Society
    • /
    • v.26 no.2
    • /
    • pp.127-134
    • /
    • 1989
  • This paper proposes a deformation method for solving practical nonlinear programming problems. Utilizing the nonlinear parametric programming technique with Quasi-Newton method [6,7], the method solves the problem by imbedding it into a suitable one-parameter family of problems. The approach discussed in this paper was originally developed with the aim of solving a system of structural optimization problems with frequently appears in various kind of engineering design. It is assumed that we have to solve more than one structural problem of the same type. It an optimal solution of one of these problems is available, then the optimal solutions of thel other problems can be easily obtained by using this known problem and its optimal solution as the initial problem of our parametric method. The method of nonlinear programming does not generally converge to the optimal solution from an arbitrary starting point if the initial estimate is not sufficiently close to the solution. On the other hand, the deformation method described in this paper is advantageous in that it is likely to obtain the optimal solution every if the initial point is not necessarily in a small neighborhood of the solution. the Jacobian matrix of the iteration formula has the special structural features [2, 3]. Sectioon 2 describes nonlinear parametric programming problem imbeded into a one-parameter family of problems. In Section 3 the iteration formulas for one-parameter are developed. Section 4 discusses parametric approach for Quasi-Newton method and gives algorithm for finding the optimal solution.

  • PDF

A State Space Modeling and Evolutionary Programming Approach to Automatic Synthesis of Chemical Processes

  • Choi, Soo-Hyoung;Lee, Bom-Sock;Chung, Chang-Bock
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1870-1873
    • /
    • 2004
  • The objective of this study is to investigate the possibility of chemical process synthesis purely based on mathematical programming when given an objective, feed conditions, product specifications, and model equations for available process units. A method based on a state space approach is proposed, and applied to an example problem with a reactor, a heat exchanger, and a separator. The results indicate that a computer can automatically synthesize an optimal process without any heuristics or expertise in process design provided that global optimization techniques are improved to be suitable for large problems.

  • PDF

The Role of S-Shape Mapping Functions in the SIMP Approach for Topology Optimization

  • Yoon, Gil-Ho;Kim, Yoon-Young
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.10
    • /
    • pp.1496-1506
    • /
    • 2003
  • The SIMP (solid isotropic material with penalization) approach is perhaps the most popular density variable relaxation method in topology optimization. This method has been very successful in many applications, but the optimization solution convergence can be improved when new variables, not the direct density variables, are used as the design variables. In this work, we newly propose S-shape functions mapping the original density variables nonlinearly to new design variables. The main role of S-shape function is to push intermediate densities to either lower or upper bounds. In particular, this method works well with nonlinear mathematical programming methods. A method of feasible directions is chosen as a nonlinear mathematical programming method in order to show the effects of the S-shape scaling function on the solution convergence.

A robust nonlinear mathematical programming model for design of laterally loaded orthotropic steel plates

  • Maaly, H.;Mahmoud, F.F.;Ishac, I.I.
    • Structural Engineering and Mechanics
    • /
    • v.14 no.2
    • /
    • pp.223-236
    • /
    • 2002
  • The main objective of the present paper is to address a formal procedure for orthotropic steel plates design. The theme of the proposed approach is to recast the design procedure into a mathematical programming model. The objective function to be optimized is the total weight of the structure. The total weight is function of its layout parameters and structural element design variables. Mean while the proposed approach takes into consideration the strength and rigidity criteria in addition to other dimensional constraints. A nonlinear programming model is developed which consists of a nonlinear objective function and a set of implicit/explicit nonlinear constraints. A transformation method is adopted for minimization strategy, where the primal model constrained problem is transformed into a sequence of unconstrained minimization models. The search strategy is based on the well-known Fletcher/Powell algorithm. The finite element technique is adopted for discretization and analysis strategies. Mindlin theory is selected to simulate the finite element model and a selective reduced integration scheme is exploited to avoid a shear lock problem.

Optimum Water Allocation System Model in Keumho River Basin with Mathematical Programming Techniques (수리계획을 이용한 금호강유역의 최적 물배분 시스템모델)

  • 안승섭;이증석
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.39 no.2
    • /
    • pp.74-85
    • /
    • 1997
  • This study aims at the development of a mathematical approach for the optimal water allocation in the river basin where available water is not in sufficient. Its optimal allocation model is determined from the comparison and analysis of mathematical programming techniques such as transportation programming and dynamic programming models at its optimal allocation models. The water allocation system used in this study is designed to be the optimal water allocation which can satisfy the water deficit in each district through inter-basin water transfer between Kumho river basin which is a tributary catchment of Nakdong river basin, and the adjacent Hyungsan river basin, Milyang river basin and Nakdong upstream river basin. A general rule of water allocation is obtained for each district in the basins as the result of analysis of the optimal water allocation in the water allocation system. Also a comparison of the developed models proves that there is no big difference between the models Therefore transportation programming model indicates most adequate to the complex water allocation system in terms of its characteristics It can be seen, however, that dynamic programming model shows water allocation effect which produces greater net benefit more or less.

  • PDF

LIMIT ANALYSIS OF CONTINUOUS STRUCTURES USING MATHEMATICAL PROGRAMMING

  • Victor-A.Pulmano;Loi, Francis-Tin
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1992.10a
    • /
    • pp.7-19
    • /
    • 1992
  • An efficient approach to limit analysis is presented whereby a continuous perfectly plastic structure is replaced by a discrete mathematical model. It is formulated as a mathematical programming problem using the static theorem of plasticity. The discretization is accomplished by writing the governing equilibrium equations in finite difference form, and is combined with piecewise linearization of the nonlinear yield curve, thus converting the formulation into a linear programming exercise. Examples of reported cases involving plates and shells are solved to illustrate the ease of application of the present method, its flexibility and accuracy - features which it make attractive to practising engineers.

  • PDF

Mathematical Programming Approach for the Multiple Forest Land Use -Comparison between STEM and Constraint Method- (다목적(多目的) 산지이용(山地利用)을 위한 수리계획법(數理計劃法)의 비교(比較))

  • Yoo, Byoung Il
    • Journal of Korean Society of Forest Science
    • /
    • v.76 no.4
    • /
    • pp.361-369
    • /
    • 1987
  • The idea of multiple-use of forest land is tile one field of economics to improve the efficiency of forest land, and is the famous management technique widely used in the developed forestry country. This paper introduces the STEM and the constraint method, which is one kind of mathematical programming techniques used for multiple forest Land use, and discusses the differences between these two methods by using the hypothetical data.

  • PDF

PCB 생산라인에서의 호이스트 스케쥴링을 위한 유전자알고리즘의 응용

  • 임준묵
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.1 no.1
    • /
    • pp.29-62
    • /
    • 1996
  • In this paper, the problem of determining cyclic schedules for a material handling hoist in the printed-circuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate. Previous approaches to the cyclic hoist scheduling problem are all mathematical programming-based approaches to develop cyclic schedules(Mixed Integer Programming, Linear Programming based Branch and Bound, Branch and Bound Search Method and so on). In this paper, a genetic algorithm-based approach for a single hoist scheduling in the PCB electroplating line is described. Through some experiments for the well known example data and randomly generated data, the proposed algorithm is shown to be more efficient than the previous mathematical programming-based algorithm.

AN OPTIMAL CONSUMPTION AND INVESTMENT PROBLEM WITH LABOR INCOME AND REGIME SWITCHING

  • Shin, Yong Hyun
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.27 no.2
    • /
    • pp.219-225
    • /
    • 2014
  • I use the dynamic programming approach to study the optimal consumption and investment problem with regime-switching and constant labor income. I derive the optimal solutions in closed-form with constant absolute risk aversion (CARA) utility and constant disutility.