• Title/Summary/Keyword: linear programing

Search Result 47, Processing Time 0.031 seconds

A Study on the Optimal Forebody Forms for Minimum Wave Resistance (최소조파 저항성능을 갖는 최적 선수형상에 관한 연구)

  • Sung-Eun Kim
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.28 no.2
    • /
    • pp.28-39
    • /
    • 1991
  • A study on the optimization problems to find forebode shapes with minimum wavemaking and frictional resistance was performed. The afterbody was fixed as a given hull and only forebode offsets were treated as design variables. Design variables were divided into the offsets of given hull and small variation from them. For the wavemaking resistance calculation, Neumann-Kelvin theory was applied to the given hull and thin ship theory was applied to the small variation. ITTC 1957 model-ship correlation line was used for the calculation of frictional resistance. Hull surface was represented mathmatically using shape function. As object function, such as wavemaking and frictional rersistance, was quadratic form of offsets and constraints linear, quadratic programing problem could be constructed. The complementary pivot method was used to find the soulution of the quadratic programing problem. Calculations were perfomed for the Series 60 $C_{B}$=0.6. at Fn=0.289. A realistic hull form could be obtained by using proper constraints. From the results of calculation for the Series 60 $C_{B}$=0.6, it was concluded that present method gave optimal shape of bulbous bow showing a slight improvement in the wave resistance performance at design speed Fn=0.289 compared with the results from the ship theory only.

  • PDF

Optimized Allocation of Water for the Multi-Purpose Use in Agricultural Reservoirs (농업용 저수지의 다목적 이용을 위한 용수의 적정배분)

  • 신일선;권순국
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.29 no.3
    • /
    • pp.125-137
    • /
    • 1987
  • The purpose of this paper is to examine some difficulties in water management of agricultural reservoirs in Korea, for there are approximately more than 15,000 reservoirs which are now being utilized for the purpose of irrigation, along with the much amount of expenses and labors to be invested against droughts and floods periodically occurred. Recently, the effective use of water resources in the agricultural reservoirs with a single purpose, is becomming multiple according to the alterable environment of water use. Therefore, the task to allocate agricultural water rationally and economically must be solved for the multiple use of agricultural reservoirs. On the basis of the above statement, this study aims at suggesting the rational method of water management by introducing an optimal technique to allocate the water in an existing agricultural reservoir rationally, for the sake of maximizing the economic effect. To achieve this objective, a reservoir, called "0-Bongje" as a sample of the case study, is selected for an agricultural water development proiect of medium scale. As a model for the optimum allocation of water in the multi-purpose use of reservoirs a linear programming model is developed and analyzed. As a result, findings of the study are as follows : First, a linear programing model is developed for the optimum allocation of water in the multi-purpose use of agricultural reservoirs. By adopting the model in the case of reservoir called "O-Bongje," the optimum solution for such various objects as irrigation area, the amount of domestic water supply, the size of power generation, and the size of reservoir storage, etc., can be obtained. Second, by comparing the net benefits in each object under the changing condition of inflow into the reservoir, the factors which can most affect the yearly total net benefit can be drawn, and they are in the order of the amount of domestic water supply, irrigation area, and power generation. Third, the sensitivity analysis for the decision variable of irrigation which may have a first priority among the objects indicate that the effective method of water management can be rapidly suggested in accordance with a condition under the decreasing area of irrigation. Fourth, in the case of decision making on the water allocation policy in an existing multi-purpose reservoir, the rapid comparison of numerous alternatives can be possible by adopting the linear programming model. Besides, as the resources can be analyed in connection with various activities, it can be concluded that the linear programing model developed in this study is more quantitative than the traditional methods of analysis. Fifth, all the possible constraint equations, in using a linear programming model for adopting a water allocation problem in the agricultural reservoirs, are presented, and the method of analysis is also suggested in this study. Finally, as the linear programming model in this study is found comprehensive, the model can be adopted in any different kind of conditions of agricultural reservoirs for the purpose of analyzing optimum water allocation, if the economic and technical coefficients are known, and the decision variable is changed in accordance with the changing condition of irrigation area.

  • PDF

A Divide-and-Conquer Algorithm for Rigging Elections Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.101-106
    • /
    • 2015
  • This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

Process Optimization Method Based on Emergency Construction Work Scenario (돌관공사 시나리오 기반 공정관리 최적화 방안)

  • Lee, Si-Hyun;Lee, Seung-hak;Woo, Mi-Sun;Son, Jae-Ho
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2015.05a
    • /
    • pp.117-118
    • /
    • 2015
  • These days buildings have more possibilities to occur construction delay as many variables and risks are inherent in them due to the enlargement and complexity. When a project is delayed, it generates extra working expenses and this causes a dispute between the employer and the constructor. Most construction sites conduct emergency construction work to recover the delay of the project duration. When an emergency construction is carried out in the actual construction site, it's necessary to utilize and distribute the proper working groups based on the procedure of successor and predecessor. Many constructions, however, have been going only with more number of work forces and working time. This study suggests a process management optimization plan with an application of emergency construction scenario by using linear programing.

  • PDF

A New Constrained Parameter Estimation Approach in Preference Decomposition

  • Kim, Fung-Lam;Moy, Jane W.
    • Industrial Engineering and Management Systems
    • /
    • v.1 no.1
    • /
    • pp.73-78
    • /
    • 2002
  • In this paper, we propose a constrained optimization model for conjoint analysis (a preference decomposition technique) to improve parameter estimation by restricting the relative importance of the attributes to an extent as decided by the respondents. Quite simply, respondents are asked to provide some pairwise attribute comparisons that are then incorporated as additional constraints in a linear programming model that estimates the partial preference values. This data collection method is typical in the analytic hierarchy process. Results of a simulation study show the new model can improve the predictive accuracy in partial value estimation by ordinal east squares (OLS) regression.

A Mathematical Structure and Formulation of Bottom-up Model based on Linear Programming (온실가스감축정책 평가를 위한 LP기반 상향식 모형의 수리 구조 및 정식화에 대한 연구)

  • Kim, Hu Gon
    • Journal of Energy Engineering
    • /
    • v.23 no.4
    • /
    • pp.150-159
    • /
    • 2014
  • Since the release of mid-term domestic GHG goals until 2020, in 2009, some various GHG reduction policies have been proposed. There are two types of modeling approaches for identifying options required to meet greenhouse gas (GHG) abatement targets and assessing their economic impacts: top-down and bottom-up models. Examples of the bottom-up optimization models include MARKAL, MESSAGE, LEAP, and AIM, all of which are developed based on linear programming (LP) with a few differences in user interface and database utilization. In this paper, we suggest a simplified LP formulation and how can build it through step-by-step procedures.

Algorithm for Grade Adjust of Mixture Optimization Problem (혼합 최적화 문제의 성분 함량 조절 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.177-182
    • /
    • 2021
  • Generally, the linear programming (LP) with O(n4) time complexity is applied to mixture optimization problem that can be produce the given ingredients grade product with minimum cost from mixture of various raw materials. This paper suggests heuristic algorithm with O(n log n) time complexity to obtain the solution of this problem. The proposed algorithm meets the content range of the components required by the alloy steel plate while obtaining the minimum raw material cost, decides the quantity of raw material that is satisfied with ingredients grade for ascending order of unit cost. Although the proposed algorithm applies simple decision technique with O(n log n) time complexity, it can be obtains same solution as or more than optimization technique of linear programing.

Optimization of Vinalines Fleet Structure in Short-term Future by Applying Linear programing and AIMMS software

  • Le, Thanh Van;Kim, Sung-june
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2015.07a
    • /
    • pp.171-172
    • /
    • 2015
  • Vinalines is actually known as not only one of Vietnam's state-sponsored economic giants but also the largest shipowner by tonnage in Vietnamese shipping industry. Therefore, a question of how to improve business performance of the corporation is always received deep attention by Vietnamese government, specially after the seriously economic scandal of Vinalines in a last few years. Among development strategies, the study focuses on short-term one in which Vinalines is recommended to restructure its own fleet in order to optimize performance of fleet operation and minimize costs while meeting the customer's shipping demand in near future. The first section is of introduction. Via method of statistical data analysis, section 2 brings to readers a panorama about the development profile and the current situation of development of Vinalines. In section 3, the authors use linear programming for setting a cost-minimization model optimizing Vinalines fleet structure based on available statistics and forecast information by Vinalines. The optimization problem is solved by applying AIMMS software in section 4. Finally, some conclusions and proposals by authors for the development of Vinalines are given.

  • PDF

Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.59-64
    • /
    • 2016
  • This paper suggests heuristic algorithm with O(mn) polynomial time complexity using Excel for partially survivable networks optimization problem of cellular telecommunication systems with m cells and n hubs. This problem only can be get the solution using linear programming or LINGO software package. The proposed algorithm connects the cell to hubs in ring network with minimum cost as the connection diversity of each cell. If the traffic of ring network (T) is T>2K for ring capacity (K), we adjust the maximum cost hub to MTSO that has a ascending order of (D/DC)/${\Delta}^+$ cell with each cell traffic demand (D) and ${\Delta}^+$=(MTSO cost-maximum cost hub) than we get the $T{\leq}2K$. Finally, we adjust MTSO to the removed maximum cost hub for the cell with 2K-$T{\geq}$(D/DC) and $_{max}{\Delta}^-$. While we using like this simple method, the proposed algorithm can be get the same optimal solution for experimental data as linear programing and LINGO software package.

Model Predictive Control for Productions Systems Based on Max-plus Algebra

  • Hiroyuki, Goto;Shiro, Masuda;Kazuhiro, Takeyasu;Takashi, Amemiya
    • Industrial Engineering and Management Systems
    • /
    • v.1 no.1
    • /
    • pp.1-9
    • /
    • 2002
  • Among the state-space description of discrete vent systems, the max-plus algebra is known as one of the effective approach. This paper proposes a model predictive control (MPC) design method based on the max-plus algebra. Several studies related to these topics have been done so far under the constraints that system parameters are constant. However, in practical systems such as production systems, it is common and sometimes inevitable that system parameters vary by each event. Therefore, it is of worth to design a new MPC controller taking account of adjustable system parameters. In this paper, we formulate system parameters as adjustable ones, and they are solved by a linear programing method. Since MPC determines optimal control input considering future reference signals, the controller can be more robust and the operation cost can be reduced. Finally, the proposed method is applied to a production system with three machines, and the effectiveness of the proposed method is verified through a numerical simulation.