• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.149-159
• /
• 2009

In this paper, we introduce some approximate optimal solutions and an augmented Lagrangian function in nonlinear programming, establish dual function and dual problem based on the augmented Lagrangian function, discuss the relationship between the approximate optimal solutions of augmented Lagrangian problem and that of primal problem, obtain approximate KKT necessary optimality condition of the augmented Lagrangian problem, prove that the approximate stationary points of augmented Lagrangian problem converge to that of the original problem. Our results improve and generalize some known results.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.1
• /
• pp.17-22
• /
• 2012

Lagrangian relaxation is the most widely adopted method for solving unit commitment (UC) problems. It consists of two steps: dual optimization and primal feasible solution construction. The dual optimization step is crucial in determining the overall performance of the solution. This paper intends to evaluate two dual optimization methods - one based on subgradient (SG) and the other based on the cutting plane. Large-scale UC problems with hundreds of thousands of variables and constraints have been generated for evaluation purposes. It is found that the evaluated SG method yields very promising results.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.55-60
• /
• 2004

This study is concerned to the perforation phenomena of the oblique dual-plate by projectile. Experiment and simulation related to that was carried out. the variables considered in this phenomena include the electrolytic zinc coated steel sheet and carbon steel rod. In the former, the confirmation and projectile velocity possible phenomena of real phenomena is done, the latter, the effect of parameter such as time-step and grid space length is analized by using the three-dimensional Lagrangian explicit time-integration finite element code, HEMP. this code use the eight node hexahedral elements and in this study, Von-Mises Criteria is used as the strength model, Mie-Gruneisen is as the Equation of State. the simulation was performed by contrast with the experiment. through the calibration of the parameter of lagrangian code, reasonable result was approached.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.246-252
• /
• 2010

A binary linear integer program is formulated for the problem of expanding the capacity of a fiber optic network and routing the traffic to deliver new interactive multimedia services. A two-phase Lagrangian dual search procedure and a Lagrangian heuristic are developed. Computational results show superior performance of the two-phase subgradient optimization compared with the conventional one-phase approach.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.624-629
• /
• 2011

In this paper, a new kernelized approach for use in a recommender system (RS) is proposed. Using a machine learning technique, the proposed method predicts the user's preferences for unknown items and recommends items which are likely to be preferred by the user. Since the ratings of the users are generally inconsistent and noisy, a robust binary classifier called a dual margin Lagrangian support vector machine (DMLSVM) is employed to suppress the noise. The proposed method is applied to MovieLens databases, and its effectiveness is demonstrated via simulations.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.647-654
• /
• 2017

Duality methods based on modified Lagrangian functional for solving a model crack problem is considered. Without additional assumptions of regularity of the solution of an initial problem duality ratio is established for initial and dual problem.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.315-315
• /
• 1999

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.3
• /
• pp.206-212
• /
• 2003

In this paper, we propose a mathematical optimization model with a suitable algorithm to determine delivery and backlogging quantities by minimizing the total cost including the penalty costs for delay. The system has fixed transshipment costs and demands are fulfilled by some delivery units that represent the volume of delivery amount to be shipped in a single time period. Since, backlogging is allowed, demands could be delivered later at the expense of some penalty costs. The model provides the optimal decisions on when and how much to he delivered while minimizing the total costs. To solve the problem, we propose an algorithm that uses the Lagrangian dual in conjunction with some primal heuristic techniques that exploit the special structure of the problem. Finally, we present some computational test results along with comments on the further study.

• Steel and Composite Structures
• /
• v.27 no.1
• /
• pp.13-25
• /
• 2018

The main objective of this study is to develop a dual approach for geometrically nonlinear finite element analysis of plane truss structures. The geometric nonlinearity is considered using the Total Lagrangian formulation. The nonlinear solution is obtained by introducing and minimizing an objective function subjected to displacement-type constraints. The proposed method can fully trace the whole equilibrium path of geometrically nonlinear plane truss structures not only before the limit point but also after it. No stiffness matrix is used in the main approach and the solution is acquired only based on the direct classical stress-strain formulations. As a result, produced errors caused by linearization and approximation of the main equilibrium equation will be eliminated. The suggested algorithm can predict both pre- and post-buckling behavior of the steel plane truss structures as well as any arbitrary point of equilibrium path. In addition, an equilibrium path with multiple limit points and snap-back phenomenon can be followed in this approach. To demonstrate the accuracy, efficiency and robustness of the proposed procedure, numerical results of the suggested approach are compared with theoretical solution, modified arc-length method, and those of reported in the literature.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.124-131
• /
• 2011

In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.