• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.67-75
• /
• 2013

The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, and lower multi-path distortion. To further utilize vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subchannel and bit allocation among users. In this paper, we compare the performance of the linear programming dual of the 0-1 integer programming formulation with the existing convex optimization approach for the optimal subchannel and bit allocation problem of the multiuser OFDM. Utilizing tight lower bound provided by the LP dual formulation, we develop a primal heurisitc algorithm based on the LP dual solution. The performance of the primal heuristic is compared with MAO, ESA heuristic solutions, and integer programming solution on MATLAB simulation on a system employing M-ary quadrature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multi-paths.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.189-195
• /
• 2021

This paper discusses choice of loans problem(CLP) that is to minimize annual payment from which bank's borrows in multi-banks multi-nations with distinct interests. For the CLP, there is impossible to obtain the optimal solution actually without the help of mathematical software package as linear programming(LP). This paper applies the method used in transportation problem(TP) that finds initial feasible solution with selects minimum interest first, least cost method(LCM), to CLP. Result of experiment, the proposed algorithm can be obtains the optimal solution with at most two exchange optimization for LCM's initial feasible solution.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.3
• /
• pp.152-157
• /
• 2005

An objected-oriented programming(OOP) technique is introduced to dispatch schedules for TWBP. Some dispatch schedules such as constrained (pre)dispatch, unconstrained (pre)dispatch, and nominal self-dispatch schedule need to be peformed to make power market work. These dispatch schedules are similar but have some differences in required constraints, needed data, and scheduling time. Therefore, it makes the scheduling program simple to introduce the OOP technique to this problem: to have each instance of the OOP perform its own dispatch scheduling. The developed program adopts linear programming(LP) as an optimization tool and could consider some crucial constraints such as power balance, generation power limits, generation ramp-rates, power limitations of transmission lines, and power system security.

• Management & Information Systems Review
• /
• v.29 no.4
• /
• pp.109-121
• /
• 2010

In this study, we propose a solution procedure to solve travelling salesman problem(TSP) with special cost function, route dependent travelling salesman problem(RDTSP). First, we develop an integer programming model to describe the problem. In the model, a variable means a possible route. And, the number of variables in this model are extremely large. So, we develop a LP relaxation problem of the IP model and solve the relaxation problem by a column generation technique. The relaxation problem does not guarantee the optimal solution. If we get an integer solution in the ralaxation problem, then the solution is an optimal one. But, if not, we cannot get an optimal solution. So, we approach a branch and price technique. The overall solution procedure can be applied a printed circuit board(PCB) assembly process.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.292-300
• /
• 2008

In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.356-367
• /
• 2008

As XML is gaining unqualified success in being adopted as a universal data representation and exchange format, particularly in the World Wide Web, the problem of querying XML documents poses interesting challenges to database researcher. Several structural XML query processing methods, including XISS and XR-tree, for past years, have been proposed for fast query processing. However, structural XML query processing has the problem of requiring expensive Join cost for twig path query Recently, sequence matching based XML query processing methods, including ViST and PRIX, have been proposed to solve the problem of structural XML query processing methods. Through sequence matching based XML query processing methods match structured queries against structured data as a whole without breaking down the queries into sub queries of paths or nodes and relying on join operations to combine their results. However, determining the structural relationship of ViST is incorrect because its numbering scheme is not optimized. And PRIX requires many processing time for matching LPS and NPS about XML data trees and queries. Therefore, in this paper, we propose efficient sequence matching method u sing the bottom-up query processing for efficient XML query processing. Also, to verify the superiority of our index structure, we compare our sequence matching method with ViST and PRIX in terms of query processing with linear path or twig path including wild-card('*' and '//').

• Korean Journal of Agricultural Science
• /
• v.4 no.2
• /
• pp.344-390
• /
• 1977

The purpose of this paper was to schedule optimum cutting strategy which could maximize the total yield under certain restrictions on periodic timber removals and harvest areas from an industrial forest, based on a linear programming technique. Sensitivity of the regulation model to variations in restrictions has also been analyzed to get information on the changes of total yield in the planning period. The regulation procedure has been made on the experimental forest of the Agricultural College of Seoul National University. The forest is composed of 219 cutting units, and characterized by younger age group which is very common in Korea. The planning period is devided into 10 cutting periods of five years each, and cutting is permissible only on the stands of age groups 5-9. It is also assumed in the study that the subsequent forests are established immediately after cutting existing forests, non-stocked forest lands are planted in first cutting period, and established forests are fully stocked until next harvest. All feasible cutting regimes have been defined to each unit depending on their age groups. Total yield (Vi, k) of each regime expected in the planning period has been projected using stand yield tables and forest inventory data, and the regime which gives highest Vi, k has been selected as a optimum cutting regime. After calculating periodic yields and cutting areas, and total yield from the optimum regimes selected without any restrictions, the upper and lower limits of periodic yields(Vj-max, Vj-min) and those of periodic cutting areas (Aj-max, Aj-min) have been decided. The optimum regimes under such restrictions have been selected by linear programming. The results of the study may be summarized as follows:- 1. The fluctuations of periodic harvest yields and areas under cutting regimes selected without restrictions were very great, because of irregular composition of age classes and growing stocks of existing stands. About 68.8 percent of total yield is expected in period 10, while none of yield in periods 6 and 7. 2. After inspection of the above solution, restricted optimum cutting regimes were obtained under the restrictions of Amin=150 ha, Amax=400ha, $Vmin=5,000m^3$ and $Vmax=50,000m^3$, using LP regulation model. As a result, about $50,000m^3$ of stable harvest yield per period and a relatively balanced age group distribution is expected from period 5. In this case, the loss in total yield was about 29 percent of that of unrestricted regimes. 3. Thinning schedule could be easily treated by the model presented in the study, and the thinnings made it possible to select optimum regimes which might be effective for smoothing the wood flows, not to speak of increasing total yield in the planning period. 4. It was known that the stronger the restrictions becomes in the optimum solution the earlier the period comes in which balanced harvest yields and age group distribution can be formed. There was also a tendency in this particular case that the periodic yields were strongly affected by constraints, and the fluctuations of harvest areas depended upon the amount of periodic yields. 5. Because the total yield was decreased at the increasing rate with imposing stronger restrictions, the Joss would be very great where strict sustained yield and normal age group distribution are required in the earlier periods. 6. Total yield under the same restrictions in a period was increased by lowering the felling age and extending the range of cutting age groups. Therefore, it seemed to be advantageous for producing maximum timber yield to adopt wider range of cutting age groups with the lower limit at which the smallest utilization size of timber could be produced. 7. The LP regulation model presented in the study seemed to be useful in the Korean situation from the following point of view: (1) The model can provide forest managers with the solution of where, when, and how much to cut in order to best fulfill the owners objective. (2) Planning is visualized as a continuous process where new strateges are automatically evolved as changes in the forest environment are recognized. (3) The cost (measured as decrease in total yield) of imposing restrictions can be easily evaluated. (4) Thinning schedule can be treated without difficulty. (5) The model can be applied to irregular forests. (6) Traditional regulation methods can be rainforced by the model.