• Title/Summary/Keyword: MANAGEMENT GOAL

Search Result 2,692, Processing Time 0.028 seconds

Software Development of Generalized Linear/Goal Programming for Microcomputer (일반화된 선형/목표계획법의 마이크로컴퓨터용 소프트웨어 개발)

  • 차동완;고재문;이원택
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.11 no.1
    • /
    • pp.51-58
    • /
    • 1986
  • The propose of this study is to presnet a generalized linear/goal programming software, which has been developed to run on mickrocomputers with at least 512 K bytes of memory. The main characteristics of our algorithm for solving LP/GP problems are outlined as follows ; First, it uses the revised simplex algorithm, which is the most efficient computational procedure for computers. Second, it employs the sparse matrix technique to overcome the limited memory of microcomputers. Last, it uses the modified product form of invers (MPFI) to reduce round-off errors. The test runs with our code written in FORTRAN show that it can be used as an effective tool for solving linear/goal programming problems of considerable size.

  • PDF

An Evolutionary Algorithm for Goal Programming: Application to two-sided Assembly Line Balancing Problems (목표계획법을 위한 진화알고리즘: 양면조립라인 밸런싱 문제에 적용)

  • Song, Won-Seop;Kim, Yeo-Geun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2008.10a
    • /
    • pp.191-196
    • /
    • 2008
  • This paper presents an evolutionary algorithm for goal programming with preemptive priority. To do this, an evolutionary strategy is suggested which search for the solution satisfying the goals in the order of the priority. Two-sided assembly line balancing problems with multiple goals are used to validate the applicability of the algorithm. In the problems, three goals are considered in the following priority order: minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational result is reported.

  • PDF

Determinants of Partner Opportunism in Distribution Channels: Relational Learning as a Control Mechanism (유통경로 구성원 간 파트너 기회주의의 결정요인과 통제기조로서의 관계학습)

  • Kim, Sang Deok
    • Knowledge Management Research
    • /
    • v.13 no.3
    • /
    • pp.37-54
    • /
    • 2012
  • The purpose of this study is to investigate determinants of partner opportunism in Korean discount store distribution channels. In addition, this study also try to examine moderating role of relational learning in the relationship. This study deals with transaction specific investment asymmetry, mutual hostages, payoff inequity, cultural diversity, and goal incompatibilities as determinants of partner opportunism. For empirical testing, 293 respondents of suppliers of discount store in Korea were surveyed and the analysis utilizing partial least square model indicated that TSI asymmetry, payoff inequity, and goal incompatibilities had positive effects on partner opportunism. On the other hand, mutual hostages had negative effect on partner opportunism. In addition, relational learning had moderating effect on the relationship between TSI asymmetry, mutual hostages, and payoff inequity and partner opportunism.

  • PDF

A New Procedure for the Initial Solution of Goal Programming (목표계획법 초기해의 새로운 절차에 관한 연구)

  • ;;Choi, Jae Bong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.1
    • /
    • pp.113-122
    • /
    • 1994
  • This study proposes a new procedure to find an initial solution to reduce the number of iterations of goal programming. The process of computing an initial solution is divided into two steps in this study. Decision variables which satisfy feasibility using Gaussian eliminations construct an initial solution reducing the iterations in the first step. It uses LHS as a tool that decision variables construct an initial solution. The initial solution which is constructed by the first step computes the updated coefficient of the objective function in the second step. If the solution does not satisfy the optimality, the optimal solution using the Modified Simplex Method is sought. The developed method doesn't reduce the overall computing time of goal programming problems, because time is more required for the process of constructing an initial solution. But The result of this study shows that the proposed procedure can reduce the large number of iterations in the first step effectively.

  • PDF

On Solving the Fuzzy Goal Programming and Its Extension (불분명한 북표계확볍과 그 확장)

  • 정충영
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.11 no.2
    • /
    • pp.79-87
    • /
    • 1986
  • This paper illustrates a new method to solve the fuzzy goal programming (FGP) problem. It is proved that the FGP proposed by Narasimhan can be solved on the basis of linear programming(LP) model. Narasimhan formulated the FGP problem as a set of $S^{K}$LP problems, each containing 3K constraints, where K is the number of fuzzy goals/constraints. Whereas Hanna formulated the FGP problem as a single LP problem with only 2K constraints and 2K + 1 additional variables. This paper presents that the FGP problem can be transformed with easy into a single LP model with 2K constraints and only one additional variables. And we propose extended FGP :(1) FGP with weights associated with individual goals, (2) FGP with preemptive prioities. The extended FGP has a framework that is identical to that of conventional goal programming (GP), such that the extended FGP can be applied with fuzzy concept to the all areas where GP can be applied.d.

  • PDF

An Aggressive Formulation of Cross-efficiency in DEA (DEA에서 교차효율성의 공격적 정형화)

  • Lim, Sung-Mook
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.4
    • /
    • pp.83-100
    • /
    • 2008
  • We propose a new aggressive formulation of cross-efficiency in Data Envelopment Analysis(DEA). In the traditional aggressive formulation, the efficiency score of a test DMU is maximized as the first goal while an average of efficiency scores of peer DMUs is minimized as the second goal. The proposed model replaces the second goal with the minimization of the best efficiency score of peer DMUs. We showed the model is a quasi-convex optimization problem, and for a solution method we developed a bisection method whose computational complexity is polynomial-time. We tested the model on 200 randomly generated DEA problems, and compared it with the traditional model in terms of various criteria. The experimental results confirmed the effectiveness and usefulness of the proposed model.

A Study of Allocation of Military Airspace and Range Using Goal Programming (목표계획법을 활용한 군 공역 및 사격장 할당 모형 연구)

  • Lyu, Hyun-Min;Lee, Moon-Gul
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.40 no.2
    • /
    • pp.63-77
    • /
    • 2015
  • The territorial air that our sovereignty is being applied to is divided into several zones and areas. In order to use and manage them effectively, these zones and areas have laws, regulations and rules. The number of airspaces (MOA : Military Operation Area) and Ranges that are used in the military are limited and many airbases are being used for training. Currently the central department manages some, and the rest are independent airbases. Therefore, efficient allocation is not performed and the result occurs where airspaces and ranges are allocated unnecessarily. This is increasing the workload of staff leading to unnecessary re-work. To slove problem, this study proposed models for allocating airspaces and ranges using goal programming with multi-objective functions of minimizing the deviations of the target values.

Action Costs-based Heuristics for Optimal Planning (최적 계획생성을 위한 동작비용 기반의 휴리스틱)

  • Kim, Wantae;Kim, Hyunsik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.2
    • /
    • pp.27-34
    • /
    • 2017
  • Highly informative admissible heuristics can help to conduct more efficient search for optimal solutions. However, in general, more informative ones of heuristics from planning problems requires lots of computational effort. To address this problem, we propose an Delete Relaxation based Action Costs-based Planning Graph(ACPG) and Action Costs-based Heuristics for solving optimal planning problems more efficiently. The ACPG is an extended one to be applied to can find action costs between subgoal & goal conditions from the Relaxed Planning Graph(RPG) which is a common means to get heuristics for solving the planning problems, Action Costs-based Heuristics utilizing ACPG can find action costs difference between subgoal & goal conditions in an effective way, and then consider them to estimate the goal distance. In this paper, we present the heuristics algorithm to compute Action Costs-based Heuristics, and then explain experimental analysis to investigate the efficiency and the accuracy of the Action Costs-based Heuristics.

Business Modeling Focused on the Viewpoint of Goal and Customer (목표 및 고객 관점에서의 비즈니스 모델링)

  • Byun, Dae-Ho;Iijima, Jun-Ichi
    • IE interfaces
    • /
    • v.18 no.2
    • /
    • pp.193-204
    • /
    • 2005
  • The modeling of business processes is key component of any improvement or re-engineering endeavor. Present trends of business modeling methodologies are to include the social context of an organization. Although various methodologies have been developed specially for the business process field and have a social context, it is not in terms of goals and customers, but processes, activities, and tasks. We describe our stance on business process modeling, based on the viewpoint of goal and customer. First, we formalize a goal-oriented business process model and its evaluation mechanism. Second, we propose a methodology of business process modeling, which starts from perceiving and describing interactions between organization and customer from the customer's viewpoint.

Determinants of Opportunism between Franchisor and Franchisee: Focusing on the Moderating Effect of Startup Experience

  • LEE, Jibaek;LEE, Hee Tae;BAE, Jungho
    • The Korean Journal of Franchise Management
    • /
    • v.12 no.1
    • /
    • pp.35-44
    • /
    • 2021
  • Purpose: This study examines the opportunism moderating effect by the startup experience in the relationship between franchisor and franchisees. In the case of a franchise system that has a continuous relational exchange transaction, relationship management is a very important activity because the relationship management between franchisor and franchisees improves the quality of the relationship. Nevertheless, there is insufficient of research on opportunism, which is a negative factor in managing the relationship between franchisor and franchisees in continuous relationship. Research design, data and methodology: This study, we explore the cause of opportunism based on transaction cost theory through prior research and establish a research model based by goal incongruity, uncertainty, information asymmetry, transaction specific assets, the relevance to determinant of opportunism and the startup experienced which is a moderating variable. To verify several hypotheses, the data were collected from 300 out of 1,760 domestic franchisees and analyzed using multiple regression analysis with SPSS program. Results: The findings are as follows. Goal incongruity did not affect opportunism. Opportunism increased as uncertainty increased, and as information asymmetry increased, opportunism increased. An opportunism decreased as transaction specific assets increased. Moreover, the findings show that startup experience only plays a moderating role in the relationship between information asymmetry and opportunism. Therefore, 4 out of 8 hypotheses were supported. Conclusions: The findings show that uncertainty, information asymmetry, and transaction specific assets are the determinants of opportunism. In addition, the results of the analysis of the moderating role of startup experience show that the less entrepreneurial experience, the greater the influence of information asymmetry on opportunism. Our findings mean that maintaining a successful relationship between franchisors and franchisees is possible when franchisors provide knowledge sharing, goal sharing, environmental sharing, and management information sharing to franchisees. In addition, the findings of this study shows that the contract content and management should be changed according to the entrepreneurial experience. In other words, the franchisors must share and integrate the accumulated franchisees' and franchisors' experience with the franchisees to create a synergy that can lead to successful bilateral relationship maintenance, which in turn reduces opportunism.