• Structural Engineering and Mechanics
• /
• v.4 no.5
• /
• pp.541-552
• /
• 1996

This paper is concerned with the structural optimization problem of maximizing the compressive buckling load of orthotropic rectangular plates for a given volume of material. The optimality condition is first derived via variational calculus. It states that the thickness distribution is proportional to the strain energy density contrary to popular claims of constant strain energy density at the optimum. An engineers physical meaning of the optimality condition would be to make the average strain energy density with respect to the depth a constant. A double cosine thickness varying plate and a double sine thickness varying plate are then fine tuned in a one parameter optimization using the Rayleigh-Ritz method of analysis. Results for simply supported square plates indicate an increase of 89% in capacity for an orthotropic plate having 100% of its fibers in $0^{\circ}$ direction.

• English Language & Literature Teaching
• /
• v.13 no.3
• /
• pp.23-40
• /
• 2007

This paper discusses why Korean speakers have problems in pronouncing some medial sonorant clusters in English. We argue that the main reasons lie in the sonority sequence requirement difference between the two languages. English does not have any specific sonority sequence preference between the medial sonorant sequences while Korean has a strict requirement between the two sonorants over a syllable boundary. This sonority sequence requirement difference between the two languages acts as an interference for Korean speakers in learning English pronunciation. This barrier for Korean speakers in acquiring correct pronunciation is implemented in a constraint ranking difference in the Optimality Theory, which is not familiar for Korean speakers. Understanding the details of sonorant production mechanisms along with the different constraint ranking will facilitate the learning process of Korean speakers learning English.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.121-127
• /
• 2004

This paper presents a new vertex selection scheme for shape approximation. In the proposed method, final vertex points are determined by "two-step procedure". In the first step, initial vertices are simply selected on the contour, which constitute a subset of the original contour, using conventional methods such as an iterated refinement method (IRM) or a progressive vertex selection (PVS) method In the second step, a vertex adjustment Process is incorporated to generate final vertices which are no more confined to the contour and optimal in the view of the given distortion measure. For the optimality of the final vertices, the dynamic programming (DP)-based solution for the adjustment of vertices is proposed. There are two main contributions of this work First, we show that DP can be successfully applied to vertex adjustment. Second, by using DP, the global optimality in the vertex selection can be achieved without iterative processes. Experimental results are presented to show the superiority of our method over the traditional methods.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.83-99
• /
• 2002

Optimality conditions are derived for a nonlinear program in which a support function appears in the objective as well as in each constraint function. Wolfe and Mond-Weir type duals to this program are presented and various duality results are established under suitable convexity and generalized convexity assumptions. Special cases that often occur in the literature are those in which a support function is the square root of a positive semi- definite quadratic form or an Lp norm. It is pointed out that these special cases can easily be generated from our results.

• Management Science and Financial Engineering
• /
• v.7 no.1
• /
• pp.41-56
• /
• 2001

This linear fractional - quadratic bilevel programming problem, in which the leader's objective function is a linear fractional function and the follower's objective function is a quadratic function, is studied in this paper. The leader's and the follower's variables are related by linear constraints. The derivations of the optimality conditions are based on Kuhn-Tucker conditions and the duality theory. It is also shown that the original linear fractional - quadratic bilevel programming problem can be solved by solving a standard linear fractional program and the optimal solution of the original problem can be achieved at one of the extreme point of a convex polyhedral formed by the new feasible region. The algorithm is illustrated with the help of an example.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1996.10a
• /
• pp.288-295
• /
• 1996

This work presents an optimality criteria method applicable io the design of plane frames with I-shape sections. All kinds of constraints are treated properly to ensure the mathematical rigour of the method as ever. Among the various properties of a section, the cross-sectional area is chosen as the design variable associated with the member. Then other properties, moment of inertia and depth, are determined from the cross-sectional area using relationships established in advance from the sectional data for AISC standard W shapes. The optimality criteria established in this work is perfect in mathematical terms provided that the relationships between properties of a section are correct. A redesign algorithm is derived relying heavily on the Newton-Raphson method to solve the system of nonlinear constraint equations. A worked example is also Presented.

• Communications for Statistical Applications and Methods
• /
• v.23 no.2
• /
• pp.119-129
• /
• 2016

A new sampling method is introduced based on the idea of a ranked set sampling scheme in which taken samples in each set are dependent on previous ones. Some theoretical results are presented and distribution-free confidence intervals are derived for the quantiles of any continuous population. It is shown numerically that the proposed sampling scheme may lead to 95% confidence intervals (especially for extreme quantiles) that cannot be found based on the ordinary ranked set sampling scheme presented by Chen (2000) and Balakrishnan and Li (2006). Optimality aspects of this scheme are investigated for both coverage probability and minimum expected length criteria. A real data set is also used to illustrate the proposed procedure. Conclusions are eventually stated.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.10a
• /
• pp.17-24
• /
• 1995

This work proposes an optimality criteria applicable to the optimum design of plane frames. Stress constraints as well as displacement constraints are treated as behavioural constraints and thus the first order approximation of stress constraints is adopted. The design space of practical reinforced concrete frames with discrete design variables has been found to have many local minima, and thus it is desirable to find in advance the mathematical minimum, hopefully global, prior to starting to search a practical optimum design. By using the mathematical minimum as a trial design of any search algorithm, we may not full into a local minimum but apparently costly design. Therefore this work aims at establishing a mathematically rigorous method ⑴ by adopting first-order approximation of constraints, ⑵ by reducing the design space whenever minimum size restrictions become "active" and ⑶ by the of Newton-Raphson Method.

• Management Science and Financial Engineering
• /
• v.21 no.1
• /
• pp.1-9
• /
• 2015

We consider an m-machine flow shop scheduling problem to minimize the latest completion time, where processing times are uncertain. Processing time uncertainty is described through a finite set of processing time vectors. The objective is to minimize maximum deviation from optimality for all scenarios. Since this problem is known to be NP-hard, we consider it with an ordered property. We discuss optimality properties and develop a pseudo-polynomial time approach for the problem with a fixed number of machines and scenarios. Furthermore, we find two special structures for processing time uncertainty that keep the problem NP-hard, even for two machines and two scenarios. Finally, we investigate a special structure for uncertain processing times that makes the problem polynomially solvable.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.745-755
• /
• 2007

The concept of slope rotatability introduced by Hader and Park(1978) is available when we are interested in the difference of the responses. Since there can be constraints on the factor levels in mixture experiments, there arises a need for adaptation of the concept of slope rotatability and the measure to assess it. In this article, measures of slope rotatability in mixture experiments are proposed to quantify the amount of slope rotatability for a given design. Measures for a restricted region design as well as for an unrestricted region design are presented. Then, the designs having different optimalities are compared with respect to these measures by some examples.