• 제목/요약/키워드: linear programing

검색결과 47건 처리시간 0.014초

정수계획법과 선형계획법을 이용한 CO2 배출량 제약과 배출권거래하의 설비계획 비교/ 분석 (Analysis of Generation Explansion Planning Considering CO2 Emission Constraints and Emission Trading under using LP(Linear Programing) and MIP(Mixed Integer Programing))

  • 신혜경;홍희정;강동주;한석만;정구형;김발호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 제38회 하계학술대회
    • /
    • pp.816-817
    • /
    • 2007
  • As UNFCC(United Nations Framework Convention on Climate Change) is enhanced, Korea will perform a CO2 reduction duty. The CO2 reduction duty will effect Korea power system because coal and oil thermal generations emit large CO2 form about 46% of total CO2 emission. Moreover various alternatives should be designed to comply with CO2 reduction duty. In this paper, we analysis resource planning considering CO2 emission constraints and emission trading. And we analysis resource planning under using LP(Linear Programing) and MIP(Mixed Integer Programing).

  • PDF

Allocation in Multi-way Stratification by Linear Programing

  • NamKung, Pyong;Choi, Jae-Hyuk
    • Communications for Statistical Applications and Methods
    • /
    • 제13권2호
    • /
    • pp.327-341
    • /
    • 2006
  • Winkler (1990, 2001), Sitter and Skinner (1994), Wilson and Sitter (2002) present a method which applies linear programing to designing surveys with multi-way stratification, primarily in situation where the desired sample size is less than or only slightly larger than the total number of stratification cells. A comparison is made with existing methods both by illustrating the sampling schemes generated for specific examples, by evaluating sample mean, variance estimation, and mean squared errors, and by simulating sample mean for all methods. The computations required can, however, increase rapidly as the number of cells in the multi-way classification increase. In this article their approach is applied to multi-way stratification using real data.

비선형계획법을 이용한 건물의 외피최적화 방법 (A Study on the Optimization Method of Building Envelope using Non-linear Programming)

  • 원종서;이경회
    • KIEAE Journal
    • /
    • 제3권2호
    • /
    • pp.17-24
    • /
    • 2003
  • The purpose of this study is to present rational methods of multi-criteria optimization of the envelope of buildings. The object is to determine the optimum R-value of the envelope of a building, based on the following criteria: minimum building costs (including the cost of materials and construction) and yearly heating costs. Mathematical model described heat losses and gains in a building during the heating season. It takes into consideration heat losses through wall, roof, floor and windows. Particular attention was paid to have a more detailed description of heat gains due to solar radiation. On the assumption that shape of building is rectangle in order to solve the problem, optimum R-value of the envelope of a building is determined by using non-linear programing methods(Kuhn-Tucker Conditions). The results constitute information for designers on the optimum R-value of a building envelope for energy saving buildings.

쿤-터커 조건을 이용한 건물의 에너지성능과 비용 최적화방법 (Optimization Method of Building Energy Performance and Construction Cost Using Kuhn-Tucker Conditions)

  • 원종서;구재오
    • KIEAE Journal
    • /
    • 제3권2호
    • /
    • pp.51-58
    • /
    • 2003
  • The purpose of this study is to present rational methods of multi-criteria optimization of the shape of energy saving buildings. The object is to determine the optimum dimension of the shape of a building, based on the following criteria: minimum building costs (including the cost of materials and construction) and yearly heating costs. Mathematical model described heat losses and gains in a building during the heating season. It takes into consideration heat losses through wall, roof, floor and windows. Particular attention was paid to have a more detailed description of heat gains due to solar radiation. On the assumption that shape of building is rectangle in order to solve the problem, the proportions of wall length and building height are determined by using non-linear programing methods(Kuhn-Tucker Conditions). The results constitute information for designers on the optimum proportions of wall lengths, height, and the ratios of window to wall areas for energy saving buildings.

선형 시변 시스템의 안정도 영역 (A stability region of linear time-varying systems)

  • 최종호;장태정
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
    • /
    • pp.130-134
    • /
    • 1987
  • 이 논문에서는 매개변수(parameter)들이 시간에 따라 변하는 선형 시변 시스템(linear time-varying system)에서 시스템의 안정도(stability)를 보장할 수 있는 매개변수들의 변동영역(perturbation region of parameters)에 대한 충분조건을 시간영역에서 Lyapunov 방법을 사용하여 구하였다. 그리고 이 충분조건을 만족하는 매개변수 변동영역을 비선형 계획법(nonlinear programing)을 이용하여 구하는 방법을 제시하였다. 시뮬레이션 결과 이 방법으로 지금까지 이루어져 왔던 다른 연구 결과들보다 더 넓고 다양한 매개변수 변동영역을 구할 수 있었다.

  • PDF

도시고속도로 램프미터링을 위한 진입극대화방안과 진출극대화방안의 비교 연구 (A Comparative Analysis between Inflow rate Maximizing and Outflow rate Maximizing for the Urban Expressway Ramp Metering)

  • 이인원;김대호
    • 대한교통학회지
    • /
    • 제14권4호
    • /
    • pp.7-29
    • /
    • 1996
  • The optimal solution obtained by a linear programming model is to maximize the ramp inflow rate. It is argued in this paper that the maximization of inflow rate is different from the maximization of outflow rate under congested conditions. Therefore, this paper proposes a systematic searching procedure from a linear programing formulation to a integer programming : first obtain the optimal solution by a linear programming and then adding weight to linear programming then. solve the optimal solution again by integer programming i.e. The proposed method is an interactive approach. Measure of effectiveness by simulation models regards the real time data(O/D, queue, delay, etc), can be utilized in the proposed interactive process.

  • PDF

Minimum Net profit Project Deleting Algorithm for Choice of Facility Expansion Projects Problem

  • Lee, Sang-Un
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권5호
    • /
    • pp.161-166
    • /
    • 2016
  • This paper suggests heuristic algorithm with O(m) linear time complexity for choice of expansion projects that can't be obtain the optimal solution using linear programming until now. This algorithm ascending sort of net profit for all projects. Then, we apply a simple method that deletes the project with minimum net profit until this result satisfies the carried over for n-years more than zero value. While this algorithm using simple rule, not the linear programing fails but the proposed algorithm can be get the optimal solution for experimental data.

선형계획법에 의한 복합영농의 최적화 방안 - 충남 서산시 A농가를 대상으로 - (Analyzing Optimal Farming System Using Linear Programming - Case of Rice Farm in Seosan County, Chungnam -)

  • 김창환;김성록;김소윤
    • 농촌지도와개발
    • /
    • 제23권2호
    • /
    • pp.123-133
    • /
    • 2016
  • According to increasing the number of rice farm households, it is important to find optimal farm scale, farm crops, and labour constraints depending on growth time. The study aims to analyze the optimal farming system using the linear programming in Seosan county, Chungnam. The survey was conducted in-depth interview to collect data from one farm household. Results show that farmers change their some crops in dry filed into ginger and hire farm labours in April. The findings should be of interest to rice farmers and policy makers to manage their farm effectively and to support them.

대입수능 선택과목 점수조정을 위한 선형계획모형 개발 및 활용 (A Linear Programming Model to the Score Adjustment among the CSAT Optional Subjects)

  • 남보우
    • 경영과학
    • /
    • 제28권1호
    • /
    • pp.141-158
    • /
    • 2011
  • This study concerns with an applicability of the management science approach to the score adjustment among the College Scholastic Aptitude Test(CSAT) optional subjects. A linear programming model is developed to minimize the sum of score distortions between optional subjects. Based on the analysis of the 377,089 CSAT(2010) applicants' performances in social science test section, this study proposes a new approach for the score equating or linking method of the educational measurement theory. This study makes up for the weak points in the previous linear programming model. First, the model utilize the standard score which we can get. Second, the model includes a goal programming concept which minimizes the gap between the adjusting goal and the result of the adjustment. Third, the objective function of the linear programing is the weighted sum of the score distortion and the number of applicants. Fourth, the model is applied to the score adjustment problem for the whole 11 optional subjects of the social science test section. The suggested linear programming model is a generalization of the multi-tests linking problem. So, the approach is consistent with the measurement theory for the two tests and can be applied to the optional three or more tests which do not have a common anchor test or a common anchor group. The college admission decision with CSAT score can be improved by using the suggested linear programming model.

퍼지 환경하에 FMS의 다목적 작업할당 모델 (A Multi-Objective Loading Model in a Flexible Manufacturing System Under Fuzzy Environment)

  • 남궁석;이상용
    • 산업경영시스템학회지
    • /
    • 제18권33호
    • /
    • pp.79-86
    • /
    • 1995
  • This paper intends to develope the multi-objective loading model in a flexible manufacturing system (FMS) to support decision maker under fuzzy environment. To obtain the optimal solution, this paper uses interactive fuzzy multi-objective linear programing(IFMOLP) and describes the process of optimal solution. As a case study, numerical examples are demonstrated to show the effectiveness of the proposed model.

  • PDF