• 아태비즈니스연구
• /
• 제9권4호
• /
• pp.99-117
• /
• 2018

This study has investigated Linear Programming (LP) applications to special decision making problems in managerial accounting with the help of spreadsheet Solver tools. It uses scenario approaches to case examples having three products and three resources in make-and-supply business operations, which is applicable to cases having more variables and constraints. Integer Programmings (IP) are applied in order to model situations when products are better valued in integer values or logical constraints are required. Three cases in one-time-only special order decisions include Goal Programming approach, Knapsack problems with 0/1 selections, and fixed-charge 0/1 integer modelling techniques for set-up operation costs. For the decisions in outsourcing problems, opportunity-costs of resources expressed by shadow-prices are considered to determine their precise contributions. It has also shown that the improvement in work-shop operation for an unprofitable product must overcome its 'reduced cost' by the sum of direct manufacturing cost savings and its shadow-price contributions. This paper has demonstrated how various real situations of special decision problem in managerial accounting can be approached without mistakes by using LP's and IP's, and how students both in accounting and management science can acquire LP skills in their education.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제6권6호
• /
• pp.555-568
• /
• 2000

월드 와이드 웹은 가장 커다란 가상 시스템이 되고 있다. 최근의 연구 분야에서, 많은 계산량을 지닌 응용을 수행시키기 위해 월드 와이드 웹에 존재하는 여러 휴지 호스트들을 이용하는 아이디어가 등장하고 있으며, 이러한 새로운 컴퓨팅 패러다임을 전역 컴퓨팅이라고 부른다. 우리는 이 논문에서 Tiger라 불리우는 이동 객체 기반 전역 컴퓨팅 프레임워크를 구현하여 제시한다. Tiger의 첫 번째 목표는 객체들의 분산, 전달, 이동과 계산행위의 동시성을 지원하는 객체 지향 프로그래밍 라이브러리를 제시하는 것이다. 이 프로그래밍 라이브러리는 프로그래머에게 분산 및 이동 객체에 대한 접근, 위치 및 이동 투명성을 제공한다. Tiger의 두 번째 목표는 전역 컴퓨팅의 요구 조건인 확장성 및 자원, 위치 관리를 지원하는 것이다. Tiger 시스템과 제공하는 프로그래밍 라이브러리는 프로그래머로 하여금 전역적으로 확장된 컴퓨팅 자원을 활용하여 객체 지향 병렬 및 분산 응용을 쉽게 작성하게 해준다. 또한, 우리는 병렬 프랙탈 이미지 처리 및 유전자 뉴로 퍼지 알고리즘과 같은 매우 많은 연산량을 지닌 응용을 Tiger 시스템에 적용하여 성능 향상 정도를 보인다.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2008년도 학술발표회 논문집
• /
• pp.389-394
• /
• 2008

The purpose of this research was to develop a methodology to determine whether conjunctive surface water and groundwater management could significantly reduce deficits in a river basin with a relatively limited alluvial aquifer. The Geum River basin is one of major river basins in South Korea. The upper region of the Geum River basin is typical of many river basins in Korea where the shape of river basin is narrow with small alluvial aquifer depths from 10m to 20m and where most of the groundwater pumped comes quickly from the steamflow. The basin has two surface reservoirs, Daecheong and Yongdam. The most recent reservoir, Yongdam, provides water to a trans-basin diversion, and therefore reduces the water resources available in the Geum River basin. After the completion of Yongdam reservoir, the reduced water supply in the Geum basin resulted in increasing conflicts between downstream water needs and required instream flows, particularly during the low flow season. Historically, the operation of groundwater pumping has had limited control and is administered separately from surface water diversions. Given the limited size of the alluvial aquifer, it is apparent that groundwater pumping is essentially taking its water from the stream. Therefore, the operation of the surface water withdrawals and groundwater pumping must be considered together. The major component of the conjunction water management in this study is a goal-programmin g based optimization model that simultaneously considers surface water withdrawals, groundwater pumping and instream flow requirements. A 10-day time step is used in the model. The interactions between groundwater pumping and the stream are handled through the use of response and lag coefficients. The impacts of pumping on streamflow are considered for multiple time periods. The model is formulated as a linear goal-programming problem that is solved with the commercial LINGO optimization software package.

• 디자인학연구
• /
• 제9권
• /
• pp.801-810
• /
• 1994

Design Problems are often both multidimensional and highly interactive. Very rarely does any part of a designed thing serve only one purpose. The activity of designing is thus a goal-directed activity and normally a goal-directed problem-solving activity. This means, problem solving is finding a way to get from some initial situation to a desired goal. Designers are transforming agents within a society whose goals are to improve the human condition through physical metamorphosis. Many theorist have agreed that designing involves problem solving or decision making. Accordingly evaluation plays an essential role in design activity. The evaluation factors include all attributes that have levels specified by quantitative and qualitative objectives Alternatives in multi-objective decision prOblems generally possess numerous attributes by which they can be described and compared. The evaluation factors include all attributes that have levels specified by quantitative and qualitative objectives. However since qualitative factors are difficult to quantify as numeral estimates, these factors have tended to be ignored without regard for their importance to human content. We adapted the Accumulative Evaluation Model as an evaluation algorithm for IDES. Industrial Design Evaluation System (IDES) consists of 3 major modules ( 1 Design Element, 2.Matrix, 3.Evaluation). It is intended to be an aid for design evaluation. The luther thinks IDES is a new design evaluation approach which could provide effective rating of design values to make value judgements. It is an attempt to provide industrial designers with access to design evaluation. The author's aim is to produce an Object-Oriented Evaluation System which can guide the designers and decision makers under complex design projects. It uses\ulcorner an Object-Oriented Programming for this prototype, Because of managing complexity (Flexibility and Reusability) and improving productivity(Extensibility & Maintainability and Programming by User) in software development process. The author has chose the C++ because it is a hybrid, rather than pure Object-Oriented Language.

• 컴퓨터교육학회논문지
• /
• 제12권1호
• /
• pp.15-22
• /
• 2009

컴퓨터 프로그래밍 언어 학습은 프로그래밍과 디버깅 과정을 통해 컴퓨터 작동원리를 이해할 수 있을 뿐만 아니라, 논리적 사고력, 문제해결력과 같은 고차원적 사고능력을 함양시켜주는 교육적 효과가 있다. 본 연구에서는 프로그래밍 언어 학습에서 학습자들의 내재적인 학습 동기를 유발하고 학습을 지속시키기 위한 방안으로 몰입이론을 적용하였다. 이를 위해 몰입의 구성 요소를 적요한 교수 학습 전략들을 개발한 후, 이것을 WBI로 설계, 구현하였다. 또한, 구현된 WBI를 실제 교수-학습 현장에 적용하여, 학습자의 몰입수준 변화와 학업성취도에 미치는 효과에 대해 검증하였다. 그 결과 몰입이론을 적용한 WBI 학습이 학습 목표의식과 도전감, 구체적인 피드백을 이루어 몰입 수준 향상에 효과적이었으며, 몰입 경험이 학습 결과에 긍정적인 영향을 끼쳐 학업성취도(프로그래밍 능력)의 향상에 효과적이었다.

• 품질경영학회지
• /
• 제18권2호
• /
• pp.18-24
• /
• 1990

The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.380-383
• /
• 2003

In this paper, we propose a fuzzy group decision making method for multiple decision maker-multiple objective programming problems to obtain the agreeable solution. In the proposed method, considering the vague nature of human subjective judgement it is assumed that each of multiple decision makers has a fuzzy goal for each of his/her own objective functions. After eliciting the membership functions from the decision makers for their fuzzy goals, total M-Pareto optimal solution concept is defined in membership spaces in order to deal with multiple decision maker-multiple objective programming problems. For generating a candidate of the agreeable solution which is total M-Pareto optimal, the extended weighted minimax problem is formulated and solved for some weighting vector which is specified by the decision makers in their subjective manner, Given the total M-Pareto optimal solution, each of the derision makers must either be satisfied with the current values of the membership functions, or update his/her weighting vector, However, in general, it seems to be very difficult to find the agreeable solution with which all of the decision makers are satisfied perfectly because of the conflicts between their membership functions. In the proposed method, each of the decision makers is requested to estimate the degree of satisfaction for the candidate of the agreeable solution. Using the estimated values or satisfaction of each of the decision makers, the core concept is desnfied, which is a set of undominated candidates. The interactive algorithm is developed to obtain the agreeable solution which satisfies core conditions.

• 국제학술발표논문집
• /
• The 2th International Conference on Construction Engineering and Project Management
• /
• pp.69-78
• /
• 2007

In real world, the project managers handle conflicting goals that govern the use of resources within the stipulated time and budget with required quality and safety. These conflicting goals are required to be optimized simultaneously by the project managers in the framework of fuzzy aspiration levels. The fuzzy linear programming model proposed herein helps project managers to minimize total project costs, completion time, and crashing costs considering indirect costs, contractual penalty costs etc by practically charging them in terms of direct cost of the project. A case study of bituminous pavement under construction is considered to demonstrate the feasibility of applying the proposed model for optimization of project parameters. Consequently, the proposed model yields an efficient compromise solution and the decision maker's overall degree of satisfaction with multiple fuzzy goal values. Additionally, the proposed model provides a systematic decision-making framework, enabling decision maker to interactively modify the fuzzy data and model parameters until a satisfactory solution is obtained. The significant characteristics that differentiate the proposed model with other models include, flexible decision-making process, multiple objective functions, and wide-ranging decision information.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권4호
• /
• pp.293-298
• /
• 2016

Document summarization is an important task in various areas where the goal is to select a few the most descriptive sentences from a given document as a succinct summary. Even without training data of human labeled summaries, there has been several interesting existing work in the literature that yields reasonable performance. In this paper, within the same unsupervised learning setup, we propose a more principled learning framework for the document summarization task. Specifically we formulate an optimization problem that expresses the requirements of both faithful preservation of the document contents and the summary length constraint. We circumvent the difficult integer programming originating from binary sentence selection via continuous relaxation and the low entropy penalization. We also suggest an efficient convex-concave optimization solver algorithm that guarantees to improve the original objective at every iteration. For several document datasets, we demonstrate that the proposed learning algorithm significantly outperforms the existing approaches.

• 대한원격탐사학회지
• /
• 제27권6호
• /
• pp.743-752
• /
• 2011

One of main concerns of operators of the Earth observation satellite is taking images as many as possible under the constraints of satellite resources during fixed period. In order to achieve this goal, satellite operators are strongly required to generate the optimized image collection plans, and it is a very time consuming process to achieve an optimized image collection plan when it is done by manual. This paper suggests automation of image collection planning based on the dynamic programming algorithm to reduce the time required for image collection planning. The validity of the proposed method is tested using operating satellite system and the result is given in this paper.