• Nonlinear Functional Analysis and Applications
• /
• v.28 no.2
• /
• pp.337-363
• /
• 2023

In this paper, we propose a new subgradient extragradient algorithm for finding a solution of monotone bilevel equilibrium problem in reflexive Banach spaces. The strong convergence of the algorithm is established under monotone assumptions of the cost bifunctions with Bregman Lipschitz-type continuous condition. Finally, a numerical experiments is reported to illustrate the efficiency of the proposed algorithm.

• Communications of the Korean Mathematical Society
• /
• v.18 no.4
• /
• pp.745-754
• /
• 2003

Maximum clique problem is to find a maximum clique(largest in size) in an undirected graph G. We present a method that computes either a maximum clique or an upper bound for the size of a maximum clique in G. We show that this method performs well on certain class of graphs and discuss the application of this method in a branch and bound algorithm for solving maximum clique problem, whose efficiency is depended on the computation of good upper bounds.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.116-123
• /
• 1990

Most algorithms utilized the horizontal epipolar lines for solving the correspondence problem in 3-D computer vision. However, the requirement is very difficult to be satisfied in real situations. In this paper, we propose a binocular-stereo matching algorithm, based on line matching method, which does not require the horizontal epipolar lines of the extreme pixels of a given line segment and two circles whose radius is equal to the maximum disparity. And we use the features including the direction of line segments, edge strength and cross-correlation for line matching. The experimental results show that the proposed algorithm can be a useful tool for solving the correspondence problem in 3-D computer vision.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1533-1539
• /
• 2011

In this paper, a class of nonlinear bilevel programs, i.e. the lower level problem is linear programs, is considered. Aiming at this special structure, we append the duality gap of the lower level problem to the upper level objective with a penalty and obtain a penalized problem. Using the penalty method, we give an existence theorem of solution and propose an algorithm. Then, a numerical example is given to illustrate the algorithm.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.461-470
• /
• 2007

Parameter identification is studied in viscoelastic rods by solving an inverse problem numerically. The material properties of the rod, which appear in the constitutive relations, are recovered by optimizing an objective function constructed from reference strain data. The resulting inverse algorithm consists of an optimization algorithm coupled with a corresponding direct algorithm that computes the strain fields given a set of material properties. Numerical results are presented for two model inverse problems; (i)the effect of noise in the reference strain fields (ii) the effect of minimal reference data in space and/or time data.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.63-81
• /
• 1995

This paper presents a model and algorithm for solving the multi-factor plant layout problem. The model can incorporate more than two factors that may be either quantitative or qualitative. The algorithm is based on simulated annealing, which has been successfully applied for the solution of combinatorial problems. A set of problems previously used by various authors is solved to demonstrate the effectiveness of the proposed methods. The results indicate that the proposed methods can yield good quality for each of eleven test problems.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.611-628
• /
• 2021

In this paper, we propose a new branch-reduction-and-bound algorithm to solve the nonlinear knapsack problems by using general discrete monotonic optimization techniques. The specific properties of the problem are exploited to increase the efficiency of the algorithm. Computational experiments of the algorithm on problems with up to 30 variables and 5 different constraints are reported.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.661-667
• /
• 1997

We consider a generalized problem of the continuous multiple choice knapsack problem and study on the LP relaxation of the candidate problems which are generated in the branch and bound algorithm for solving the generalized problem. The LP relaxed candidate problem is called the generalized continuous multiple choice linear knapsack problem and characterized by some variables which are partitioned into continuous multiple choice constraints and the others which only belong to simple upper bound constraints. An efficient algorithm of order O($n^2logn$) is developed by exploiting some structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.105-111
• /
• 2015

This paper suggests O(n) linear-time algorithm for car sequencing problem (CSP) that has been classified as NP-complete because of the polynomial-time algorithm to solve the solution has been unknown yet. This algorithm applies maximum options-equiped car type first production rule to decide the car sequencing of n meet the r:s constraint. This paper verifies thirteen experimental data with the six data are infeasible. For thirteen experimental data, the proposed algorithm can be get the solution for in all cases. And to conclude, This algorithm shows that the CSP is not NP-complete but the P-problem. Also, this algorithm proposes the solving method to the known infeasible cases. Therefore, the proposed algorithm will stand car industrial area in good stead when it comes to finding a car sequencing plan.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.8
• /
• pp.122-129
• /
• 1997

In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.