• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.823-835
• /
• 2010

In this paper, A FSQP algorithm for degenerate inequality constraints optimization problems is proposed. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving a quadratic programming subproblem. To overcome the Maratos effect, a higher-order correction direction is obtained by solving another quadratic programming subproblem. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions. Finally, some preliminary numerical results are reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.2
• /
• pp.25-34
• /
• 1981

In this paper, we propose a non-edge following method for linear programs. Unlike alledged poor performance of algorithms of this type, this method performs well at least with 25 randomly generated problems. This method is comparable to Rosen's gradient projection method as applied to the dual formulation. The latter is of general purpose, and no implementation rules are available for linear program applications. This paper suggests ways of finding improving dual feasible directions, and of allowing to move across the extreme faces of a higher dimension polyhedron. Rather simple computational rules are provided for projection operations needed at each iteration.

• Journal of the military operations research society of Korea
• /
• v.11 no.1
• /
• pp.79-86
• /
• 1985

A multi-interchange simplex method is presented. This method tries to cut almost half of the set of convex combinations which generate all decreasing feasible directions. Analysis of this method indicates high possibility of the existence of polynomial-time simplex-type methods.

• Structural Engineering and Mechanics
• /
• v.77 no.5
• /
• pp.613-626
• /
• 2021

In this paper, an enhanced Violation-based Sensitivity analysis and Border-Line Adaptive Sliding Technique (ViS-BLAST) will be utilized for optimization of some well-known structural and mechanical engineering problems. ViS-BLAST has already been introduced by the authors for solving truss optimization problems. For those problems, this method showed a satisfactory enactment both in speed and efficiency. The Enriched ViS-BLAST or EVB is introduced to be vastly applicable to any solvable constrained optimization problem without any specific initialization. It uses one-directional step-wise searching technique and mostly limits exploration to the vicinity of FNF border and does not explore the entire design space. It first enters the feasible region very quickly and keeps the feasibility of solutions. For doing this important, EVB groups variables for specifying the desired searching directions in order to moving toward best solutions out or inside feasible domains. EVB was employed for solving seven numerical engineering design problems. Results show that for problems with tiny or even complex feasible regions with a larger number of highly non-linear constraints, EVB has a better performance compared to some records in the literature. This dominance was evaluated in terms of the feasibility of solutions, the quality of optimum objective values found and the total number of function evaluations performed.

• Journal of the military operations research society of Korea
• /
• v.18 no.2
• /
• pp.140-150
• /
• 1992

In this paper, we consider the shortest path problem of a Robot car moving in a workspace which consists of some obstacles. The motion of the Robot car is considered to have initial and final directions with some restrictions in the curvature of the path. At first we consider the problem in the case of having no obstacles and we give an analytical solution. Then wre present an algorithm to find a feasible path in the case of having obstacles and a method to improve this feasible path into a minimal path. Some computational results using Graph theory and Linear programming have been included.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.1
• /
• pp.1-7
• /
• 2003

The aerodynamic optimization method for airfoil design was described in this paper. The Navier-Stokes equations were solved to consider the viscous flow information around an airfoil. The Modified Method of Feasible Direction(MMFD) was used for sensitivity analysis and the polynomial interpolation was used for distance calculation of the minimization. The Message Passing Interface(MPI) library of parallel computation was adopted to reduce the computation time of flow solver by decomposing the entire computational domain into 8 sub-domains and one-to-one allocating 8 processors to 8 sub-domains. The parallel computation was also used to compute the sensitivity analysis by allocating each search direction to each processor. The present optimization reduced the drag of airfoil while the lift is maintained at the tolerable design value.

• KSTLE International Journal
• /
• v.5 no.1
• /
• pp.23-27
• /
• 2004

The object of the present work is the numerical analysis of the computer hard disk slider. The pressure between slider and disk surfaces is calculated using the Boundary Fitted Coordinate System and Divergence Formulation for the nonlinear Reynolds' equation solution. The optimization scheme is applied to search for the steady state position of the slider. The simplified method is given for the case of the fixed inclined pad. The film thickness ratios and pitching and rolling angles are considered as alternative choice of the slider's coordinates. The behavior of the objective function for the Negative Pressure slider is studied in details. Methods of conjugate directions and feasible directions are applied.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.89-100
• /
• 2022

With the advancement in the Internet of things Technology (IoT) cloud computing, billions of physical devices have been interconnected for sharing and collecting data in different applications. Despite many advancements, some latency - specific application in the real world is not feasible due to existing constraints of IoT devices and distance between cloud and IoT devices. In order to address issues of latency sensitive applications, fog computing has been developed that involves the availability of computing and storage resources at the edge of the network near the IoT devices. However, fog computing suffers from many limitations such as heterogeneity, storage capabilities, processing capability, memory limitations etc. Therefore, it requires an adequate task scheduling method for utilizing computing resources optimally at the fog layer. This work presents a comprehensive review of different task scheduling methods in fog computing. It analyses different task scheduling methods developed for a fog computing environment in multiple dimensions and compares them to highlight the advantages and disadvantages of methods. Finally, it presents promising research directions for fellow researchers in the fog computing environment.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.2 s.173
• /
• pp.319-328
• /
• 2000

This paper presents a new design method of the 1 generation wheel bearing unit using a numerical optimization technique in order to increase bearing fatigue life. For calculating the fatigue life, a method of load analysis is studied on the automotive wheel bearing system. The design variables selected are ball size, initial contact angle, number of balls, pitch diameter, pre-load, and distance between ball centers. The method of feasible directions in ADS (Automated Design Synthesis) is utilized to automatically find the optimum design variables. To validate the design method, a computer program is developed and applied to a practical passenger car model. The optimum design results demonstrated the effectiveness of the proposed design method showing that the system life of the optimally designed wheel bearing unit is enhanced in comparison with that of the initial ones within the given available design space.

• Journal of Mechanical Science and Technology
• /
• v.17 no.10
• /
• pp.1496-1506
• /
• 2003

The SIMP (solid isotropic material with penalization) approach is perhaps the most popular density variable relaxation method in topology optimization. This method has been very successful in many applications, but the optimization solution convergence can be improved when new variables, not the direct density variables, are used as the design variables. In this work, we newly propose S-shape functions mapping the original density variables nonlinearly to new design variables. The main role of S-shape function is to push intermediate densities to either lower or upper bounds. In particular, this method works well with nonlinear mathematical programming methods. A method of feasible directions is chosen as a nonlinear mathematical programming method in order to show the effects of the S-shape scaling function on the solution convergence.