• Journal of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.1179-1194
• /
• 2015

In this paper, we introduce a new iterative algorithm for finding a common element of the set of solutions of a generalized mixed equilibrium problem related to a continuous monotone mapping, the set of solutions of a variational inequality problem for a continuous monotone mapping, and the set of fixed points of a continuous pseudocontractive mapping in Hilbert spaces. Weak convergence for the proposed iterative algorithm is proved. Our results improve and extend some recent results in the literature.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.6
• /
• pp.1213-1222
• /
• 2012

The aim of this paper is to establish the existence of three solutions for a Sturm-Liouville mixed boundary value problem. The approach is based on multiple critical points theorems.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.211-225
• /
• 2004

A mixed type dual to a programming problem containing support functions in a objective as well as constraint functions is formulated and various duality results are validated under generalized convexity and invexity conditions. Several known results are deducted as special cases.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.251-264
• /
• 2004

We introduce a semidiscrete mixed finite element approximation for the single-phase linear Stefan problem and show the unique existence of the approximation. And the optimal rate of convergence in $L^2$ and $H^1$ norms are derived.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.819-837
• /
• 2008

A mixed type dual to the control problem in order to unify Wolfe and Mond-Weir type dual control problem is presented in various duality results are validated and the generalized invexity assumptions. It is pointed out that our results can be extended to the control problems with free boundary conditions. The duality results for nonlinear programming problems already existing in the literature are deduced as special cases of our results.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.191-207
• /
• 2007

Based on a mixed Galerkin approximation, we construct the fully discrete approximations of $U_y$ as well as U to a single-phase quasilinear Stefan problem with a forcing term in non-divergence form. We prove the optimal convergence of approximation to the solution {U, S} and the superconvergence of approximation to $U_y$.

• IE interfaces
• /
• v.13 no.2
• /
• pp.204-210
• /
• 2000

This paper deals with the problem of mixed-model sequencing on an assembly line. In this sequencing problem we want to minimize the risk of the conveyor stoppage and the total utility work. This paper applies genetic algorithm to solve the mixed-model sequencing problem which is formulated as an integer programming. The solution we get from this algorithm is compared with the solution of Tsai(1995)'s.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.531-551
• /
• 2021

In this paper, we consider a mixed boundary value problem to a class of nonlinear operators containing p(x)-Laplacian. More precisely, we consider the problem with the Dirichlet condition on a part of the boundary and the Steklov boundary condition on an another part of the boundary. We show the existence of at least three weak solutions under some hypotheses on given functions and the values of parameters.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.23-35
• /
• 1990

A mathematical model for a dynamic capacitate facility location problem is formulated by a mixed integer problem. The objective of the model is to minimize total discounted costs that include fixed charges and distributed costs. The Cross Decomposition method of Van Roy is extended and applied to solve the dynamic capacitated facility location problem. The method unifies Benders Decomposition and Lagrangean relaxation into a single framework. It successively solves a transportation problem and a dynamic uncapacitated facility location problem as two subproblems. Computational results are compared with those of general mixed integer programming.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.4
• /
• pp.249-260
• /
• 2008

In this work we propose a mixed finite volume method for the Signorini problem which are based on the idea of Keller's finite volume box method. The triangulation may consist of both triangles and quadrilaterals. We choose the first-order nonconforming space for the scalar approximation and the lowest-order Raviart-Thomas vector space for the vector approximation. It will be shown that our mixed finite volume method is equivalent to the standard nonconforming finite element method for the scalar variable with a slightly modified right-hand side, which are crucially used in a priori error analysis.