• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.1-7
• /
• 1993

Vector optimization problems consist of two or more objective functions and constraints. Optimization entails obtaining efficient solutions. Geoffrion [3] introduced the definition of the properly efficient solution in order to eliminate efficient solutions causing unbounded trade-offs between objective functions. In 1974, Isermann [7] obtained a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with linear constraints and showed that every efficient solution is a properly efficient solution. Since then, many authors [1, 2, 4, 5, 6] have extended the Isermann's results. In particular, Gulati and Islam [4] derived a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with nonlinear constraints, under certain assumptions. In this paper, we consider the following nonlinear vector optimization problem (NVOP): (Fig.) where for each i, f$_{i}$ is a differentiable function from R$^{n}$ into R and g is a differentiable function from R$^{n}$ into R$^{m}$ .

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.971-985
• /
• 2007

A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and ${\epsilon}$-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we present a proposition with a sufficient condition for an efficient solution to be properly efficient, which are a generalization of the well-known Isermann result for a linear vector optimization problem. An example is given to illustrate the significance of our main results. Also, we give an example showing that the proper efficiency may not imply certain closeness assumption.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.279-287
• /
• 2004

In this paper, we establish relations between a solution of a vector continuous-time program and a solution of a vector variational-type inequality problem with functionals.

• East Asian mathematical journal
• /
• v.37 no.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.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.181-191
• /
• 2006

In this paper, multiobjective generalized fractional programming problems with set functions are considered, in which objective functions are maximum of finite fractional set functions. At first, optimality conditions are established. Then, saddle existence theorem is proved.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.431-438
• /
• 2010

In this paper, using nonsmooth analysis, we established equivalence results between a locally Lipschitz vector optimization problem and its associated approximated problem under the proper efficiency.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.685-692
• /
• 2009

We consider the linearized (approximated) problem for differentiable vector optimization problem, and then we establish equivalence results between a differentiable vector optimization problem and its associated linearized problem under the proper efficiency.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.25 no.4
• /
• pp.485-495
• /
• 2001

This paper presents a similarity solution for the directional casting of binary peritectic alloys in the presence of shrinkage-induced flow. The present model retains essential ingredients of alloy solidification, such as temperature-solute coupling, macrosegregation, solid-liquid property differences, and finite back diffusion in the primary phase. An algorithm for simultaneously determining the peritectic and liquidus positions is newly developed, which proves to be more efficient and stable than the existing scheme. Sample calculations are performed for both hypo- and hyper-peritectic compositions. The results show that the present analysis is capable of properly resolving the solidification characteristics of peritectic alloys so that it can be used for validating numerical models as a test solution.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.219-232
• /
• 2002

In numerically controlled(NC) machining simulation, a Z-map has been used frequently for representing a workpiece. Since the Z-map is usually represented by a set of Z-axis aligned vectors, the machining process can be simulated through calculating the intersection points between the vectors and the surface swept by a machining tool. In this paper, we present an efficient method to calculate those intersection points when an APT-type tool moves along a linear tool path. Each of the intersection points can be expressed as the solution of a system of non-linear equations. We transform this system of equations into a single-variable equation, and calculate the candidate interval in which the unique solution exists. We prove the existence of a solution and its uniqueness in this candidate interval. Based on these characteristics, we can effectively apply numerical methods to finally calculate the solution of the non-linear equations within a given precision. The whole process of NC simulation can be achieved by updating the Z-map properly. Our method can provide more accurate results with a little more processing time, in comparison with the previous closed-form solution.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2003.11a
• /
• pp.402-409
• /
• 2003

Inversion of traveltime requires an efficient algorithm for computing the traveltime as well as its $Frech\hat{e}t$ derivative. We compute the traveltime of the head waves using the damped wave solution in the Laplace domain and then present a new algorithm for calculating the $Frech\hat{e}t$ derivative of the head wave traveltimes by exploiting the numerical structure of the finite element method, the modem sparse matrix technology, and SWEET algorithm developed recently. Then, we use a properly regularized steepest descent method to invert the traveltime of the Marmousi-2 model. Through our numerical tests, we will demonstrate that the refraction tomography with large aperture data can be used to construct the initial velocity model for the prestack depth migration.