• 제목/요약/키워드: Feasible region

검색결과 209건 처리시간 0.027초

바다숲 조성사업의 경제적 효과 분석 : 강릉 주문진 바다숲 조성사업을 대상으로 (An Economic Analysis of the Marine Afforestation Project in Gangneung Region, Republic of Korea)

  • 박경일;홍혜수;김도훈
    • 수산해양교육연구
    • /
    • 제28권3호
    • /
    • pp.727-737
    • /
    • 2016
  • This study is aimed to analyze the economic effectiveness (direct fishing income effect) of the marine afforestation project in Gangneung region. Based on the surveyed data, the production values and costs of the marine afforestation project are estimated and compared to determine the economic validity of the marine afforestation project. Results show that the B/C ratio, as an indicator of economic evaluation, is 1.30 with an interest rate of 5.5%, indicating that the marine afforestation project in Gangneung region would be economically feasible under the current production and market conditions. However, it is expected that the economic effectiveness would be increased when considering benefits of recreational fishing and greenhouse gas reduction from the marine afforestation project.

경북지역 해삼 종묘방류사업의 경제적 효과 분석 (Analyzing Economic Effectiveness of the Sea Cucumber Seed Releasing Program in Gyeongsangbuk-do Region)

  • 박경일;김영준;김도훈
    • 수산경영론집
    • /
    • 제44권1호
    • /
    • pp.81-90
    • /
    • 2013
  • This study is aimed to analyze economic effectiveness of the sea cucumber seed releasing program in Gyeongsangbuk-do region. Based on the surveyed data, the production value of released sea cucumber and the seed releasing program cost are estimated and compared to determine the economic validity of the sea cucumber seed releasing program. Results show that the B/C ratio, as an indicator of economic evaluation, is 2.0, indicating that the sea cucumber seed releasing program in Gyeongsangbuk-do region would be economically feasible under the current production and market conditions. Sensitivity analyses of main variables indicate that the economic effectiveness can be increased when the recapture rate would be increased and the seed price of sea cucumber would be decreased.

A Formulation of Hybrid Algorithm for Linear Programming

  • Kim, Koon-Chan
    • 한국경영과학회지
    • /
    • 제19권3호
    • /
    • pp.187-201
    • /
    • 1994
  • This paper introduces an effective hybridization of the usual simplex method and an interior point method in the convergent framework of Dembo and Sahi. We formulate a specific and detailed algorithm (HYBRID) and report the results of some preliminary testing on small dense problems for its viability. By piercing through the feasible region, the newly developed hybrid algorithm avoids the combinatorial structure of linear programs, and several other interesting and important characteristics of this algorithm are also discussed.

  • PDF

Multi-objective Scheduling with Stochastic Processing Times

  • Jung, Young-Sik
    • 한국경영과학회지
    • /
    • 제20권1호
    • /
    • pp.179-193
    • /
    • 1995
  • A multi-objective, single-stage scheduling problem with stochastic processing times is considered where the objective is to simultaneously minimize the expected value and the variance of total flowtime, and the mean probability of tardiness. In cases where processing times follow normal distributions, a method using pairwise interchange of two jobs(PITJ) is proposed to generate a set of the approximate efficient schedules. The efficient schedules are not dominated by the criterion vectors of any other permutation schdules in the feasible region. Numerical experiments performed to ascertain the effectiveness of PITJ algorithm are also reported in the results.

  • PDF

Regularity of solutions to Helmholtz-type problems with absorbing boundary conditions in nonsmooth domains

  • Kim, Jinsoo;Dongwoo Sheen
    • 대한수학회보
    • /
    • 제34권1호
    • /
    • pp.135-146
    • /
    • 1997
  • For the numerical simulation of wave phenomena either in unbounded domains that it is not feasible to compute solutions on the entire region, it is needed to truncate the original domains to manageable bounded domains whose geometries are simple but usually nonsmooth. On the artificial boundaries thus created, absorbing boundary conditions are taken so that the significant part of waves arriving at the artificial boundaries can be transmitted [5,10,11,16,17,26]$.

  • PDF

이산 섬유 배열각을 이용한 복합재료 적층 평판의 최적 설계 (Layup Optimization for Composite Laminates with Discrete Ply Angles)

  • 김태욱
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집A
    • /
    • pp.734-739
    • /
    • 2001
  • In this paper, an algorithm for stacking sequence optimization which deals with discrete ply angles is used for optimization of composite laminated plates. To handle discrete ply angles, the branch and bound method is modified. Numerical results show that the optimal stacking sequence is found with fewer evaluations of objective function than expected with the size of feasible region, which shows the algorithm can be effectively used for layup optimization of composite laminates..

  • PDF

개선된 고차 Convex 근사화를 이용한 구조최적설계 (Structural Optimization using Improved Higher-order Convex Approximation)

  • 조효남;민대홍;김성헌
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2002년도 가을 학술발표회 논문집
    • /
    • pp.271-278
    • /
    • 2002
  • Structural optimization using improved higer-order convex approximation is proposed in this paper. The proposed method is a generalization of the convex approximation method. The order of the approximation function for each constraint is automatically adjusted in the optimization process. And also the order of each design variable is differently adjusted. This self-adjusted capability makes the approximate constraint values conservative enough to maintain the optimum design point of the approximate problem in feasible region. The efficiency of proposed algorithm, compared with conventional algorithm is successfully demonstrated in the Three-bar Truss example.

  • PDF

0-1 정수계획법을 위한 사전처리의 구현 ((An Implementation of Preprocessing for 0-1 Integer Programming))

  • 엄순근
    • 한국국방경영분석학회지
    • /
    • 제25권1호
    • /
    • pp.133-140
    • /
    • 1999
  • Preprocessing for the -01 integer programming can reduce the size of problem instance as well as tighten its linear programming relaxations. In this research, the preprocessing techniques are classified into two categories. First, for the reduction of problem size, there are variable fixing and constraint elimination techniques. Second, for the reduction of feasible region, there are coefficient reduction and Euchidean reduction techniques. These methods are implemented and the effects are shown by experimental results.

  • PDF

Optimal proportioning of concrete aggregates using a self-adaptive genetic algorithm

  • Amirjanov, Adil;Sobol, Konstantin
    • Computers and Concrete
    • /
    • 제2권5호
    • /
    • pp.411-421
    • /
    • 2005
  • A linear programming problem of the optimal proportioning of concrete aggregates is discussed; and a self-adaptive genetic algorithm is developed to solve this problem. The proposed method is based on changing a range of variables for capturing the feasible region of the optimum solution. A computational verification of this method is compared with the results of the linear programming.

Robotic extralevator excision of a retrorectal giant aggressive angiomyxoma

  • Kelley, Scott R.
    • Obstetrics & gynecology science
    • /
    • 제61권6호
    • /
    • pp.693-697
    • /
    • 2018
  • Aggressive angiomyxoma (AA) is a very rare mesenchymal tumor most commonly found in the pelvic and perineal regions. For the complete excision of retrorectal tumors, with extension through the levator muscle into the ischioanal space, open anterior and posterior approaches are typically required. Herein, we report our experience with robotic excision of a giant presacral AA with extralevator extension into the ischioanal space and extraction via Pfannenstiel incision, which we found to be technically feasible, efficacious, and safe to perform. Mayo Clinic Institutional Review Board exemption status was obtained for this study.