• Industrial Engineering and Management Systems
• /
• 제12권1호
• /
• pp.36-40
• /
• 2013

The paper discusses the problem of how to allocate the fund to a large number of individuals in a higher school so as to bring a higher utility return based on the theory of uncertain set. Suppose that experts can assign each invested individual a corresponding nondecreasing membership function on a close interval I according to its actual level and developmental foreground. The membership degree at the fund $x{\in}I$ is called utility degree from fund x, and product (minimum) of utility degrees of distributed funds for all invested individuals is called united utility degree from the fund. Based on the above concepts, we present an uncertain optimization model, called Maximal United Utility Degree (or Maximal Membership Degree) model for fund distribution. Furthermore, we use nondecreasing polygonal functions defined on close intervals to structure a mathematical maximal united utility degree model. Finally, we design a genetic algorithm to solve these models.

• 한국경영과학회지
• /
• 제3권2호
• /
• pp.95-108
• /
• 1978

This paper discusses an application of mathematical programming techniques in the paper industry in determining optimal parent roll widths. Parent rolls are made from the reels produced at wide paper machines by slitting them to more manageable widths. The problem is finding a set of the slitting patterns that will minimize the trim loss involved in the sheeting operation. Two programming models, one linear and one mixed integer linear, are presented in this paper. Also presented are the computational experience, the model sensitivity, and the comparison of the optimal solutions with the simulated operational data.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국내학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.511-517
• /
• 1988

Movement order program of robot operating program is generally made by teach-in method. Therefore in most cases it is sufficient as long as the robot system shows a reguired repeatability for the working conditions. But the trend in the robot application moves to the automatic generation of the working programs. A mathematical robot model similar to the reality is necessary for the analysis of the kinematic transformation of the robot system. The purposes of this paper are to make a better describing form and to suggest an automatic algorithm for kinematic parameter identification.

• 산업공학
• /
• 제17권3호
• /
• pp.282-293
• /
• 2004

Line Balancing is the problem to assign tasks to stations while satisfying some managerial viewpoints. Most researches about the Mixed-Model Line Balancing problems are focused on the minimizing the total processing time or the number of workstations. Independently, some research reports consider the balance issues of the physical workloads on the assembly line. In this paper, we are presenting a new mathematical model to accomplish the line balance considering both the processing time and the workloads at the same time. To this, end, we propose an zero-one integer program problem, and we use the Chebyshev Goal Programming approach as the solution method. Some computational test runs are performed to compare the pay-offs between the processing time and the workloads. And, the test results show us that the reliable balanced work schedules can be obtained through the proposed model.

• 한국컴퓨터산업학회논문지
• /
• 제2권11호
• /
• pp.1407-1420
• /
• 2001

지식 기반 사회를 맞이하여 컴퓨터 교육에 대한 관심이 점점 높아가고 있다. 컴퓨터 교육에서 프로그래밍 교육은 매우 중요하다. 그러나, 기존의 프로그래밍 교육은 프로그래밍 언어의 문법에 대한 기계적 암기나 사용법을 익히는 것에 치중해 왔다. 그래서 그 프로그램이 갖는 의미와 어떻게 다른 방법으로 구현될 수 있는지 등의 논리적인 사고를 키우는데 적합하지 못했다. 이런 프로그래밍 교육의 현실을 개선하여 정보 소양을 기르고 문제 해결 능력의 함양이라는 프로그래밍 교육의 목표를 달성하기 위해서는 프로그래밍 교육의 접근 방법에 대한 개선이 필수적이다. 따라서 본 논문에서는 프로그래밍 학습에 대한 새로운 접근법으로 프로그래밍 언어의 기초가 되는 C언어를 통해 프로그래밍에 대한 기본적인 통찰력과 테크닉을 기를 수 있도록 수학 프로그래밍 소스들을 구현하고자 한다. 이는 프로그래밍 학습에 대한 흥미와 관심이 증대되며 프로그래밍에 대한 경험을 쌓는 과정에서 문제 해결력 및 논리적 사고력의 향상과 프로그래밍에 대한 감각을 키워주는 좋은 경험이 될 것이다.

• 정보처리학회논문지B
• /
• 제9B권3호
• /
• pp.277-286
• /
• 2002

양자역학 섭동이론과 유전자프로그래밍(GP) 기법을 접목시킴으로써 실세계(Real-world)에서 발생하는 카오스 시계열에 대하여 수학모델을 구축, 예측하기 위한 새로운 알고리즘을 개발하였다. 시계열 분석과 양자역학 파동방정식의 해를 구하는 섭동이론과의 절차적 유사성을 논하고, 이것을 GP로 구현하는 전형적 접근방안을 제시한다. 함수집합(Function Set)으로서 직교함수(Orthogonal Functions)를 이용하고 병렬 집단을 사용하는 GP를 이용하여 원 시계열에 대한 초기 수학모델을 구하고, 원 시계열 데이터로부터 모델의 평가값을 뺀 나머지로 구성되는 잔여 시계열에 대하여 다시 GP를 적용하는 과정을 일정한 종료조건이 충족될 때가지 반복함으로써 실세계 카오스 시계열에 대한 정확성 높은 수학모델을 구축하는데 성공하였다. 타 방법론과의 비교와 향후 해결과제에 대하여도 소개한다.

• 제어로봇시스템학회논문지
• /
• 제4권4호
• /
• pp.534-542
• /
• 1998

In this paper a simulation model for the powertrain control of gasoline engines with automatic transmission is presented. A modular programming approach has been pursued and the MATLAB/SIMULINK has been utilized as the programming environment. The engine/transmission system is analyzed in the object-oriented fashion whereby easy transferal of the modules, which represent physical parts or analysis subsystems, is guaranteed. Some mathematical models are adopted from the literature to compare the simulation results with the model and the experimental results in the literature. It is expected that the whole program or individual module constructed in this paper are useful for the automotive engineers in designing a new engine/transmission system and/or in modifying parts of existing systems.

• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.63-71
• /
• 2009

The traditional portfolio optimization problem is to find an investment plan for securities with reasonable trade-off between the rate of return and the risk. The seminal work in this field is the mean-variance model by Markowitz, which is a quadratic programming problem. Since it is now computationally practical to solve the model, a number of alternative models to overcome this complexity have been proposed. In this paper, among the alternatives, we focus on the Mean Absolute Deviation (MAD) model. More specifically, we developed an algorithm to obtain an optimal portfolio from the MAD model. We showed mathematically that the algorithm can solve the problem to optimality. We tested it using the real data from the Korean Stock Market. The results coincide with our expectation that the method can solve a variety of problems in a reasonable computational time.

• Water Engineering Research
• /
• 제4권1호
• /
• pp.1-17
• /
• 2003

A mathematical model was developed to simulate the performance of a prototype wind-powered reverse osmosis desalination system. The model consists of two sub-models operated in a series. The first sub-model is the wind-energy conversion sub-model, which has wind energy and feed water as its input and pressurized feed water as its output. The second sub-model is a reverse osmosis (RO) process sub-model, with pressurized feed water as its input and the flow and salinity of the product water or permeate as its output. Model coefficients were determined based on field experiments of a prototype wind powered RO desalination system of the University of Hawaii, from June to December 2001. The mathematical model developed by this study predicts the performance of wind-powered RO desalination systems under different design conditions. The system optimization is achieved using a linear programming approach. Based on the results of system optimization, a design guide is prepared, which can be used by both manufacturer and end-user of the wind-driven reverse osmosis system.

• 경영과학
• /
• 제10권1호
• /
• pp.193-205
• /
• 1993

This paper presents a mathematical model for a class of vertical integration decisions. The problem structure of interest consists of raw material vendors, components suppliers, components processing plants, final product (assembly) plants and external components buyers. Economic feasibility of operating components plants instead of keeping outside suppliers is our major concern. The model also determines assignment of product lines and production volumes to each open plant considering the cost impacts of economies of scale and plant complexity. The problem formulation leads to a concave, mixed integer mathematical program. Given the state of the art of nonlinear programming techniques, it is often not possible to find global optima for reasonably sized such problems. We developed an optimization solution algorithm within the framework of Benders decomposition for the case of a piecewise linear concave cost function. It is shown that our algorithm generates optimal solutions efficiently.