• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3831-3851
• /
• 2015

This paper is concerned with the problem of joint resource allocation and user-pairing in virtual MIMO SC-FDMA systems to improve service quality of experience (QoE). No-reference logarithmic model is introduced to quantify service experience for each user and the objective is to maximize sum of all user's mean of score (MOS). We firstly formulate the optimal problem into an S-dimensional (S-D) assignment problem. Then, to solve this problem, the modified Lagrangian relaxation algorithm is deduced to obtain the suboptimal result of joint user-paring and subchannel allocation. The merits of this solution are as follows. First, the gap between its results and the global optimal one can be quantified and controlled by balancing the complexity and accuracy, which merit the other suboptimal algorithms do not have. Secondly, it has the polynomial computational complexity and the worst case complexity is O(3LN³), where L is the maximum iteration time and N is the number of subchannels. Simulations also prove that our proposed algorithm can effectively improve quality of experience and the gap between our proposed and the optimal algorithms can be controlled below 8%.

• 대한산업공학회지
• /
• 제9권2호
• /
• pp.3-8
• /
• 1983

The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.

• 경영과학
• /
• 제12권2호
• /
• pp.89-103
• /
• 1995

Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.300-324
• /
• 1995

This research investigates the automatic identification of typical embedded structures in the Integer Programming(IP) models and automatic transformation of the problem to an adequate Lagrangian problem which can provide tight bounds within the acceptable run time. For this purpose, the structural distinctiveness of variables, constants, blocks of terms, and constraint chunks is identified to describe the structure of the IP model. To assist the identification of the structural distinctiveness, the representation by the knowledge based IP model formulator UNIK-IP is adopted. For the reasoning for the structural identification, the bottom-up, top-down, and case-based approaches are proposed. A prototype system UNIK-RELAX is developed to implement the approaches proposed in this research.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 제39회 하계학술대회
• /
• pp.532-533
• /
• 2008

연계지역 전력시장 간의 에너지 거래는 전체 전력시장의 사회적 편익을 향상시키기 위해 이루어진다. 기존의 연계지역 전력시장 간시장 최적화 문제를 다루는 중앙처리 접근방식은 경쟁적 전력시장 환경하에서 적합한 모델이 아니다. 본 논문은 연계지역 전력시장 문제를 다루기 위해 보완 라그랑지안 승수 기법(Augmented Lagrangian Relaxation) 기반의 분산처리 최적화 방법을 제시한다. Block Coordinate Descent(BCD) 분산처리 기법이 보완 라그랑지안 승수의 최적화 문제를 분리하기 위해 적용된다. 연계시장 모델을 구현한 사례연구를 통해 제시된 알고리즘의 효용성을 입증한다.

• Journal of information and communication convergence engineering
• /
• 제1권2호
• /
• pp.93-97
• /
• 2003

This paper proposes a new generation scheduling algorithm which can consider total quantity of contamination and energy limits based on Lagrangian Relaxation. First, we formulate a Lagrangian function which consider quantity of contamination including substitution of fuel, and quantity of fuel. Second, we developed Multi-state S.U.D.P. which can treat multiple fuels. Third, we propose an effective generation scheduling algorithm including Multi-state S.U.D.P.. As a results, unit commitment and generating power can be obtained to meet the environmental and fuel constraints with fuel substitution. By applying it to the test system, effectiveness of the method is verified.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.303-312
• /
• 1994

The problem of optimally allocating available communication channels in a cellular mobile system with nonuniform traffic distribution is considered. This problem is to minimize the weighted average blocking probability subject to cochannel interference constraints. We use the concept of pattern to deal with the problem more conveniently. Using Lagrangian relaxation and subgradient optimization techniques, we obtain high-quality solutions with information about their deviations from true optimal solutions. Computational experiments show that our method works very well.

• 한국국방경영분석학회지
• /
• 제9권1호
• /
• pp.51-61
• /
• 1983

Lagrangian relaxation is used to the problem of scheduling jobs on unrelated parallel processors with the objective of minimizing makespan. The implicit condition for optimality is drawn out explicitly in order to apply the subgradient algorithm. To obtain the optimal solution, branch-and-bound-search method is devised. In the search, the special structure of the problem is exploited effectively, Some computational experiences with the algorithm are presented, and comparisons are made with the Land and Doig method.

• 전자공학회논문지S
• /
• 제34S권9호
• /
• pp.13-22
• /
• 1997

In this paper, we supposed allocating the number of redundancies as the model of 0-1 knapsack problem and formulated the problem to maximize the systems reliability for a mission length. The formulated problem reduced the problem size using the modified branch and bound algorithm by Lagrangian relaxation. The subgradient method can optimize the set of solution. To verify the proposed method, we presented the improved resutls of the systems composed of two and ten component groups as the commparison of those in other papers.

• 대한전기학회논문지
• /
• 제43권3호
• /
• pp.351-362
• /
• 1994

This paper presents a new method for solving a long term unit commitment problem including hydro and pumped storage hydro units in a large scale power system. The proposed method makes it possible to get variable power of hydro and pumpde storage hydro units and results in the better unit commitment with good convergency. Moreover this paper proposes an unit commitment algorithm to consider variable power of these units effectively by Lagrangian Relaxation method. By applying the proposed method to the test system and the real system, it is verified the usefulness of this method.