• Title/Summary/Keyword: solve the problem

Search Result 11,866, Processing Time 0.037 seconds

Integer Programming Approach to Line Optimization of Multiple Surface Mounters (정수계획법에 의한 다수 표면실장기의 라인 최적화)

  • Kim Kyung-Min;Park Tae-Hyoung
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.4
    • /
    • pp.46-54
    • /
    • 2006
  • We propose an optimization method for PCB assembly lines including multiple surface mounters. To increase the productivity of PCB assembly line, the component allocation, feeder assignment, and assembly sequence of each surface mounter should be optimized. The optimization Problem is formulated as an integer programming problem. We divide the overall problem into two hierarchical sub-problems: forward-path problem and backward-path problem. The clustering algorithm and branch-and-bound algorithm are applied to solve the forward-path problem. The assignment algorithm and connection algorithm are applied to solve the backward-path problem. Simulation results are presented to verify the usefulness of the proposed method.

  • PDF

Theory and Research on Curriculum Reconstruction focusing on the chapters related to Problem Solving in Elementary School Mathematics (수학과 교육과정 재구성의 이론과 실제 -초등 문제해결 관련 내용을 중심으로-)

  • 신항균;황혜정
    • School Mathematics
    • /
    • v.1 no.2
    • /
    • pp.617-636
    • /
    • 1999
  • This study was executed with the intention of guiding ‘open education’ toward a desirable school innovation. The basic two directions of curriculum reconstruction essential for implementing ‘open education’ are one toward intra-subject (within a subject) and inter-subject (among subjects). This study showed an example of intra-subject curriculum reconstruction with a problem solving area included in elementary mathematics curriculum. In the curriculum, diverse strategies to enhance ability to solve problems are included at each grade level. In every elementary math textbook, those strategies are suggested in two chapters called ‘diverse problem solving’, in which problems only dealing with several strategies are introduced. Through this method, students begin to learn problem solving strategies not as something related to mathematical knowledge or contents but only as a skill or method for solving problems. Therefore, problems of ‘diverse problem solving’ chapter should not be dealt with separatedly but while students are learning the mathematical contents connected to those problems. Namely, students must have a chance to solve those problems while learning the contents related to the problem content(subject). By this reasoning, in the name of curriculum reconstruction toward intra-subject, this study showed such case with two ‘diverse problem solving’ chapters of the 4th grade second semester's math textbook.

  • PDF

A Face Optimization Algorithm for Optimizing over the Efficient Set

  • Kim, Dong-Yeop;Taeho Ahn
    • Korean Management Science Review
    • /
    • v.15 no.1
    • /
    • pp.77-85
    • /
    • 1998
  • In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solutions of a multiple objective linear program. Since the efficient set is in general a nonconvex set, problem (P) can be classified as a global optimization problem. Perhaps due to its inherent difficulty, relatively few attempts have been made to solve problem (P) in spite of the potential benefits which can be obtained by solving problem (P). The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations.

  • PDF

The Maximin Linear Programming Knapsack Problem With Extended GUB Constraints (확장된 일반상한제약을 갖는 최대최소 선형계획 배낭문제)

  • 원중연
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.3
    • /
    • pp.95-104
    • /
    • 2001
  • In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

  • PDF

The A Study on the Non-powered Circulator to Solve the Temperature Stratification of a Convection Heating Device during Winter Using 3D Printer (3D프린터를 이용한 겨울철 대류난방기구의 온도 성층화 해결을 위한 무동력 서큘레이터 디자인에 관한 연구)

  • Kang, Hee-Ra
    • Journal of Digital Convergence
    • /
    • v.19 no.6
    • /
    • pp.285-292
    • /
    • 2021
  • Due to the recent Corona 19 outbreak, camping culture is rapidly drawing attention from many people. Convective heating devices, which many campers use during winter, have the temperature stratification problem. To solve this problem, various power circulators are being used. Several non-powered circulators are also on sale, but the direction of the circulator is designed to be at the right angle relative to the convection heating mechanism and the circulator does not properly play the role of air circulation. To solve this problem, a 3D printer is used to design a non-powered circulator in the same direction as the convection heating mechanism. Electricity is generated without power using Peltier element and ceramic paper and the circulator is produced to withstand heat using HTPLA-CF filament. This study presents a method to solve the temperature stratification problem through efficient convective circulation. In addition, the purpose of this study is to manufacture products at a lower cost by using a 3D printer.

NONLINEAR FRACTIONAL PROGRAMMING PROBLEM WITH INEXACT PARAMETER

  • Bhurjee, A.K.;Panda, G.
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.5_6
    • /
    • pp.853-867
    • /
    • 2013
  • In this paper a methodology is developed to solve a nonlinear fractional programming problem, whose objective function and constraints are interval valued functions. Interval valued convex fractional programming problem is studied. This model is transformed to a general convex programming problem and relation between the original problem and the transformed problem is established. These theoretical developments are illustrated through a numerical example.

An interactive weight vector space reduction procedure for bicriterion linear programming

  • Lee, Dongyeup
    • Korean Management Science Review
    • /
    • v.13 no.2
    • /
    • pp.205-213
    • /
    • 1996
  • This paper develops a simple interactive procedure which can be efficiently used to solve a bicriteria linear programming problem. The procedure exploits the relatively simple structure of the bicriterion linear programming problem. Its application to a transportation problem is also presented. The results demonstrate that the method developed in this paper could be easily applicable to any bicriteria linear program in general.

  • PDF

Piston-Ring Lubrication Analysis Using Finite Element Method (유한 요소법을 이용한 피스턴 링의 윤활 해석)

  • 심현해;권오관
    • Tribology and Lubricants
    • /
    • v.8 no.1
    • /
    • pp.38-43
    • /
    • 1992
  • In solving the Reynolds equation in dynamically loaded bearing problem, it is almost impossible to find the squeeze velocity and the cavitation region by analytical method. Finite Element Method was applied to the piston-ring lubrication analysis to solve the complementary problem. The method was very efficient and any convergence problem was not encountered.

Optical Shutdown Control of Nuclear Reactor: A Numerical SSlution (원자로의 최적 운전정지 제어방법의 수치해)

  • 강영규;변증남
    • 전기의세계
    • /
    • v.27 no.6
    • /
    • pp.58-62
    • /
    • 1978
  • The problem of optimal shutdown control of nuclear reactor having nonlinear dynamics is considered. Since the problem, being a bounded state space problem, is difficult to solve by conventional analytic methods such as Pontryagin's maximum principle, it is approached directly by the quasilinearization technique, and solved numerically. The solution obtained in this manner proves to be an improvement over the previous results.

  • PDF