• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.323-334
• /
• 2003

This paper presents a goal-programming (GP) model for management decision-making for sugarcane fertilizer mix problems. Sensitivity analysis on the priority structure of the goals has been performed to obtain all possible solutions. The study uses Euclidean distance function to measure distances of all possible solutions from the ideal solution. The optimum solution is determined from the minimum distance between the ideal solution and other possible solutions of the problem. The optimum solution corresponds to the appropriate priority structure of the problem in the decision-making context. furthermore, the results obtained from sensitivity analysis on the cost of combination of fertilizers confirm the priority structure.

• Asia pacific journal of information systems
• /
• 제9권3호
• /
• pp.75-92
• /
• 1999

Executive information systems (EIS) developers are faced with an increasingly difficult choice problem in the evaluation and selection of software packages. For many reasons, they frequently must depend on identification and evaluation of features of packages. When EIS software evaluation is regarded as an unstructured or semi-structured group decision making problem, the most appropriate decision-aiding methods are needed to help effective group interaction. This paper examines evaluation criteria of full-featured EIS packages and considers the priority of these criteria using the Analytic Hierarchy Process (AHP). Two exploratory phases are presented. In the first phase, an approach combining the AHP with the linear weighted attribute method is presented to computer qualities of some packages. In the second phase, the decision making group includes EIS developers, users, and vendors to prioritize evaluation criteria.

• Management Science and Financial Engineering
• /
• 제15권2호
• /
• pp.101-118
• /
• 2009

In quantitative contexts, data mining is widely applied to the prediction of stock prices from financial time-series. However, few studies have examined the potential of data mining for shedding light on the qualitative problem-solving knowledge of experts who make stock price predictions. This paper presents a GA-based data mining approach to characterizing the qualitative knowledge of such experts, based on their observed predictions. This study is the first of its kind in the GA literature. The results indicate that this approach generates rules with higher accuracy and greater coverage than inductive learning methods or neural networks. They also indicate considerable agreement between the GA method and expert problem-solving approaches. Therefore, the proposed method offers a suitable tool for eliciting and representing expert decision rules, and thus constitutes an effective means of predicting the stock price index.

• Management Science and Financial Engineering
• /
• 제9권2호
• /
• pp.21-45
• /
• 2003

Various organizational factors effect successful implementation of IT enabled business transformation. Among them, the most critical success factor is deemed to overcoming change management problem. Lots of studies have been made on implementation methodologies and business process formalizations to encourage organizational members to accept new business process changes. However, the logic of process redesign still depends on qualitative problem solving techniques mostly depending on basically human intuition such as brainstorming, cause-and-effect analysis, and so on. In this paper, we develop algorithmic procedure applicable to designing various business process changes such as process automation, business process resequencing, and more radical process integration. The framework is employed from dynamic programming approach in the literature, which is based on the decision making paradigm of organizations to abstract business processes as quantitative decision models. As such, our research can fill the gap of limited development of theory based analytic methodologies for business process design, by providing objective rationale to reach the consensus among the organizational members including senior management.

• 대한산업공학회지
• /
• 제19권4호
• /
• pp.41-48
• /
• 1993

Prime advantage of flexible manufacturing systems(FMS) is a flexibility. Flexibility is expected to prolong the service life of a manufacturing facility and enable it to respond quickly and economically to dynamic market change. The FMS loading decision is concerned with the allocation of operations and tools to machines subject to technological and capacity constraints of the system. Modern FMS loading problem has the multiple objectives such as processing cost, time and work load balance. We propose multi-objectives which could be used to formulate the loading/routeing problem and sequencing decision which should be adopted for each part type in order to maximize the machine flexibility by Hamming distance matrix based on Incidance matrix. Finally, a numerical example is provided to illustrate the proposed model.

• Spatial Information Research
• /
• 제1권1호
• /
• pp.63-72
• /
• 1993

현재의 GIS가 감당할 수 있는 것은 모든 공간적 문제는 아니다. 그동안 알려진 GIS는 정보를 생산해 내는 정보위주의 GIS일뿐 정보의 다각적 이해와 의사결정과 정에 깊이 관여하지 못하였다. 단순문제(structured problems)들을 해결하기에는 정보위주의 GIS가 적합하지만 계획과 설계와 같은 비단순문제(ill-structured problems)들을 다루기에는 미흡한 단계이며, 이 단계에서 도약하기 위해 개념위주의 SDSS(Spatual Decision Suppert System)로 발전되어야 한다. 이 글에서는 개념위주의 SDSS가 비단순문제 해결을 지원하기 위한 기구로서 소개되며 정보위주 GIS의 미래상으로 비젼(vision)을 제시한다.

• 한국통신학회논문지
• /
• 제36권7B호
• /
• pp.771-779
• /
• 2011

It is expected that many heterogeneous wireless systems, such as 3GPP LTE systems, WiMAX systems and WLAN systems, will coexist in the next generation wireless communication environments. Integrated radio resource management and seamless vertical handoff (VHO) should be supported to provide integrated communication services over multi-radio access networks. A new class of adaptive VHO system that views the handoff problem as a pattern recognition problem is proposed. In this paper, we propose a unified radio resource management (URRM) architecture and Support Vector Machine (SVM) based vertical handoff decision system. Extensive simulation studies show the proposed VHO algorithm outperforms RSS based VHO algorithms in terms of throughput and service 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.

• 경영과학
• /
• 제31권1호
• /
• pp.27-40
• /
• 2014

Tour products have been recognized as a perishable asset. For tour operation companies (TOCs), improving profitability is a core decision problem for their business. Since package tour products, typical products of TOCs, are perishable after the tour was departed, TOCs have been tried to increase their sales before the departure date with various marketing strategies including price discounts. The pricing problem for perishable assets have been studied in Revenue Management for a long time. However, it is hard to find a research on pricing decisions for tour products. In this paper, we focus on a pricing problem for tour products. In particular, we will consider the pricing scheme with customer preference values on purchasing conditions. With conjoint analysis, we can use the part-worth value as a preference value for each level of purchasing conditions. To construct various discount prices, we use an enumeration method and suggest a mathematical optimization model. With experimental analysis for a sample tour package, we will show that our pricing process is very helpful for designing customer-oriented pricing decision.

• Journal of Communications and Networks
• /
• 제14권2호
• /
• pp.121-129
• /
• 2012

In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.