• Journal of Environmental Science International
• /
• v.5 no.2
• /
• pp.229-241
• /
• 1996

This study was performed to find the most desirable emission reduction for each mobile source pollutant and the optimal control strategy at a given level of expenditures in Pusan City in 2000 by using the interactive s-constraint method developed by Chang-Hyo Lee and Hyung-Wook Kim, which isone of the mathematical programming models. The most desirable emission reduction is 7093 ton/year for particulate (TSP), 4871 ton/year for NOx, 5148 ton/year for HC and 36779 ton/year for CO. The optimal control strategy is as follows; 1. As to passenger car and taxi, limiting VKT (vehicle kilometers travelled) in congested areas will be necessary. In addition to this, improving vehicie inspection Program should be enforced. 2. As to small-gasoline bus, traffic adaptive control system will be necessary. 3. As to small-diesel bus, non-adjustable engine parameters will have to be applied. .4. As to heal bus and heart truck, catalytic trap oxidizer and limiting VKT in congested areas will do necessary. 5. As to motorcycle, 2-cycle motorcycles should be converted to 4-cycle motorcycles.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.345-354
• /
• 2006

In this paper first, we find a canonical symmetrical trapezoidal(triangular) for the solution of the fuzzy linear system $A\tilde{x}=\tilde{b}$, where the elements in A and $\tilde{b}$ are crisp and arbitrary fuzzy numbers, respectively. Then, a model for fuzzy linear programming problem with fuzzy variables (FLPFV), in which, the right hand side of constraints are arbitrary numbers, and coefficients of the objective function and constraint matrix are regarded as crisp numbers, is discussed. A numerical procedure for calculating a canonical symmetrical trapezoidal representation for the solution of fuzzy linear system and the optimal solution of FLPFV, (if there exist) is proposed. Several examples illustrate these ideas.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.355-356
• /
• 2005

The problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities is considered by Yager[Fuzzy Sets and Systems, 81(1996) 89-101]. He obtained how this problem can be modelled as a mixed integer linear programming problem. Recently, Carlsson et al. [Fuzzy Sets and Systems, 139(2003) 543-546] obtained a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem with a single constraint on the sum of all decision variables. In this note, we introduce anew approach to the same problem as Carlsson et al. considered. Indeed, it is a direct consequence of a known result of the linear programming problem.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.228-233
• /
• 2006

This paper introduces design method for air pump system using bond graph and genetic programming to maximize outflow subject to a constraint specifying maximum power consumption. The air pump system is a mixed domain system which includes electromagnetic, mechanical and pneumatic elements. Therefore an appropriate approach for a better system for synthesis is required. Bond graphs are domain independent, allow free composition, and are efficient for classification and analysis of models. Genetic programming is well recognized as a powerful tool for open-ended search. The combination of these two powerful methods, BG/GP, was tested for redesign of air pump system.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.3
• /
• pp.1064-1072
• /
• 2017

The power of controlled generators in microgrids randomly fluctuate because of the stochastic volatility of the outputs of photovoltaic systems and wind turbines as well as the load demands. To address and dispatch these stochastic factors for daily operations, a dynamic economic dispatch model with the goal of minimizing the generation cost is established via chance-constrained programming. A Monte Carlo simulation combined with particle swarm optimization algorithm is employed to optimize the model. The simulation results show that both the objective function and constraint condition have been tightened and that the operation costs have increased. A higher stability of the system corresponds to the higher operation costs of controlled generators. These operation costs also increase along with the confidence levels for the objective function and constraints.

• Journal of Nutrition and Health
• /
• v.52 no.4
• /
• pp.342-353
• /
• 2019

Purpose: The Dietary Reference Intakes for Koreans (KDRIs) suggest that the goal for the intake of sodium should be less than 2,000 mg, which is thought to be infeasible to achieve when eating the typical Korean diet. This study aimed to obtain the new intake goals for sodium with improved feasibility to achieve, and also to design optimized food intake patterns for Korean adults by performing linear programming. Methods: The data from a one day 24-hour dietary recall of the 2010 ~ 2014 Korea National Health and Nutrition Survey were used to quantify food items that Korean adults usually consumed. These food items were categorized into seven groups and 24 subgroups. The mean intakes and intake distributions of the food groups and the food subgroups were calculated for eight age (19 ~ 29, 30 ~ 49, 50 ~ 64, and over 65 years old) and gender (male and female) groups. A linear programming model was constructed to minimize the difference between the optimized intakes and the mean intakes of the food subgroups while meeting KDRIs for energy and 13 nutrients, and not exceeding the typical quantities of each of the food subgroups consumed by the respective age and gender groups. As an initial solution of the linear programming, the optimized intake of seasonings, including salt, was calculated as 0 g for all the age and gender groups when the sodium constraint was inserted not to exceed 2,000 mg. Therefore, the sodium constraint was progressively increased by 100 mg until the optimized intake of seasoning was obtained as the values closest to the $25^{th}$ percentile of the intake distribution of seasonings for the respective age and gender groups. Results: The optimized food intake patterns were mathematically obtained by performing linear programming when the sodium constraint values were 3,600 mg, 4,500 mg, 4,200 mg, 3,400 mg, 2,800 mg, 3,100 mg, 3,100 mg, and 2,500 mg for the eight age and gender groups. Conclusion: The optimized food intake patterns for Korean adults were designed by performing linear programming after increasing the sodium constraint values from 2,000 mg to 2500 ~ 4,500 mg according to the age and gender groups. The resulting patterns suggest that current diets should be modified to increase the intake of vegetables for all the groups, milk/dairy products for the female groups, and fruits for the female groups except for the females aged 50 ~ 64 years.

• Environmental and Resource Economics Review
• /
• v.11 no.3
• /
• pp.345-375
• /
• 2002

The purpose of this paper is to measure the change of the production efficiency which may happen when environmental regulation incurs technological constraint in the process of production, and to compute the opportunity cost of pollution reduction with the lost products based on the change of efficiency. The patterns of production technoloy in the paper are divided into the technologies of strong disposability and weak disposabilty to grasp the effect of the technological constraint due to the environmental regulation. The endowment of the technolgical constraints in the process of production is considered to bring the greatest restriction on firm's production. When the environmental efficiencies of Korean regional manufactures were measured with linear programming model, the lost products related with the constraint of production technology that environmental regulation incurred, was average 148.1 billion dollar per year(5.87% of one year overall products) for total manufactures in 1991~1998. The ratio of the lost products for total products was spread from 0.78% to 1l.08%. The average lost products of 15 regions were changed from 4.66% to 18.35% of total products. Generally the environmental efficiency index of regional manufactures being decreased continuously since 1991, it is estimated that the environmental performance of Korean manufactures has been more and more deteriorating.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.471-477
• /
• 2005

This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.1
• /
• pp.21-30
• /
• 2021

Mid-course trajectory of the missiles equipped with seeker should be designed to detect target within FOV of seeker and to maximize the maneuverability at the point of transition to terminal guidance phase. Because the trajectory optimization problems are generally hard to obtain the analytic solutions due to its own nonlinearity with several constraints, the various numerical methods have been presented so far. In this paper, mid-course trajectory optimization problem for boost-glide missiles is calculated by using SOCP (Second-Order Cone Programming) which is one of convex optimization methods. At first, control variable augmentation scheme with a control constraint is suggested to reduce state variables of missile dynamics. And it is reformulated using a normalized time approach to cope with a free final time problem and boost time problem. Then, partial linearization and lossless convexification are used to convexify dynamic equation and control constraint, respectively. Finally, the results of the proposed method are compared with those of state-of-the-art nonlinear optimization method for verification.