• East Asian mathematical journal
• /
• 제37권5호
• /
• pp.543-551
• /
• 2021

Recently, semidefinite optimization problems have been intensively studied since many optimization problem can be changed into the problems and the the problems are very computationable. In this paper, we consider a semidefinite linear vector optimization problem (VP) and we establish the optimality theorems for (VP), which holds without any constraint qualification.

• 한국복합재료학회:학술대회논문집
• /
• 한국복합재료학회 2000년도 춘계학술발표대회 논문집
• /
• pp.38-42
• /
• 2000

In this study, the low velocity impact behavior of the composite laminates has been described by using 3 dimensional nonlinear finite elements. To describe the geometric nonlinearity due to large deformation, the dynamic contact problem is formulated using the exterior penalty finite element method on the base of Total Lagrangian formulation. The incremental decomposition is introduced, and the converged solution is attained by Newton-Raphson Method. The Newmark's constant-acceleration time integration algorithm is used. To make verification of the finite element program developed in this study, the solution of the nonlinear static problem with occurrence of large deformation is compared with ABAQUS, and the solution of the static contact problem with indentation is compared with the Hertz solution. And, the solution of low velocity impact problem for isotropic material is verificated by comparison with that of LS-DYNA3D. Finally the contact force of impact response from the nonlinear analysis are compared with those from the linear analysis.

• 대한수학회보
• /
• 제26권2호
• /
• pp.127-134
• /
• 1989

This paper proposes a deformation method for solving practical nonlinear programming problems. Utilizing the nonlinear parametric programming technique with Quasi-Newton method [6,7], the method solves the problem by imbedding it into a suitable one-parameter family of problems. The approach discussed in this paper was originally developed with the aim of solving a system of structural optimization problems with frequently appears in various kind of engineering design. It is assumed that we have to solve more than one structural problem of the same type. It an optimal solution of one of these problems is available, then the optimal solutions of thel other problems can be easily obtained by using this known problem and its optimal solution as the initial problem of our parametric method. The method of nonlinear programming does not generally converge to the optimal solution from an arbitrary starting point if the initial estimate is not sufficiently close to the solution. On the other hand, the deformation method described in this paper is advantageous in that it is likely to obtain the optimal solution every if the initial point is not necessarily in a small neighborhood of the solution. the Jacobian matrix of the iteration formula has the special structural features [2, 3]. Sectioon 2 describes nonlinear parametric programming problem imbeded into a one-parameter family of problems. In Section 3 the iteration formulas for one-parameter are developed. Section 4 discusses parametric approach for Quasi-Newton method and gives algorithm for finding the optimal solution.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제9권1호
• /
• pp.42-46
• /
• 2009

Das et al. [EJOR 117(1999) 100-112] discussed the real valued solution procedure of the multiobjective transportation problem(MOTP) where the cost coefficients of the objective functions, and the source and destination parameters have been expressed as interval values by the decision maker. In this note, we consider the interval valued solution procedure of the same problem. This problem has been transformed into a classical multiobjective transportation problem where the constraints with interval source and destination parameters have been converted into deterministic ones. Numerical examples have been provided to illustrate the solution procedure for this case.

• 재활간호학회지
• /
• 제6권2호
• /
• pp.183-191
• /
• 2003

Purpose: To examine the effect of the solution-focused group counseling program on the nursing students' problem-solving capacity. Methods: The research design was one-group pretest-posttest design in quasi-experimental research. The subjects were 16 sophomore nursing students being in K university located in D city, Korea. The period of this research was from January 9 to February 20, 2002, from January 10 to February 21, 2003. The group counseling program that was developed by Kim, Hyeon Mi (2001) on the basis of the fundamental principles of solution-focused therapy of de Shazer, et al. (1986) and the solution-focused group counseling process proposed by Selekman (1991), LaFountain, et al. (1996) and Metcalf (1998) was used after being modified and complemented for the nursing students. The group counseling was carried out six times for 120 minutes per week. The instruments used for this study were the Problem Solving Inventory developed by Heppner and Petersen (1982) and Scaling question. Collected data were analyzed by paired t-test with SPSS program. Results: 1) Problem solving capacity increased after solution-focused group counseling program, but a significant difference was not revealed(t=0.835, p=0.057). 2) The scores of self-confidence with the problem-solving were significantly increased when it was compared with the 1st and the 6th(t=3.587, p=0.001). Conclusion: It seems that the solution-focused group counseling program should be considered as an effective nursing intervention program for the nursing students by improving self-confidence with the problem-solving. As a results, this study suggests that the specific techniques used in the solution focused therapy should be applied actively in areas of counseling and communication training for the nursing students and nurses.

• 유통과학연구
• /
• 제15권2호
• /
• pp.15-20
• /
• 2017

Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

• 한국컴퓨터정보학회논문지
• /
• 제20권10호
• /
• pp.61-68
• /
• 2015

This paper deals with the pre-marshalling problem that the containers of container yard at container terminal are relocated in consensus sequence of loading schedule of container vessel. This problem is essential to improvement of competitive power of terminal. This problem has to relocate the all of containers in a bay with minimum number of movement. There are various algorithms such as metaheuristic as genetic algorithm and heuristic algorithm in order to find the solution of this problem. Nevertheless, there is no unique general algorithm that is suitable for various many data. And the main drawback of metaheuristic methods are not the solution finding rule but can be find the approximated solution with many random trials and by coincidence. This paper can be obtain the solution with O(m) time complexity that this problem deals with bin packing problem for m stack bins with descending order of take out ranking. For various experimental data, the proposed algorithm can be obtain the optimal solutions for all of data. And to conclude, this algorithm can be show that most simple and general algorithm with simple optimal solution finding rule.

• 호남수학학술지
• /
• 제20권1호
• /
• pp.89-95
• /
• 1998

We show by using some properties of an elliptic integral that certain scalar semilinear elliptic problem has a unique solution.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.236-246
• /
• 2008

We consider the Inventory Routing problem(IRP) for the vending machine operating system. An artificial immune system(AIS) is introduced to solve the IRP. The IPR is an rolling wave planning. The previous solution of IRP is one of good initial solution of current IRP. We introduce an Artificial Immune system with memory cell (AISM) which store previous solution in memory cell and use an initial solution for current problem. Experiment results shows that AISM reduced calculations time in relatively less demand uncertainty.

• Kyungpook Mathematical Journal
• /
• 제62권1호
• /
• pp.89-106
• /
• 2022

We are concerned with finding a common solution to an equilibrium problem associated with a bifunction, and a constrained convex minimization problem. We propose an iterative fixed point algorithm and prove that the algorithm generates a sequence strongly convergent to a common solution. The common solution is identified as the unique solution of a certain variational inequality.