• 제목/요약/키워드: global optimality

검색결과 44건 처리시간 0.023초

OPTIMAL CONTROL OF GLOBAL PRESS FOR AN ADSORBATE-INDUCED PHASE TRANSITION MODEL

  • Ryu, Sang-Uk
    • 충청수학회지
    • /
    • 제21권4호
    • /
    • pp.543-553
    • /
    • 2008
  • This paper is concerned with the optimal control problem of global press for an adsorbate-induced phase transition model. That is, we show the existence of the optimal control and derive the optimality conditions. Moreover, we obtain the uniqueness of the optimal control.

  • PDF

GLOBAL PARAMETRIC SUFFICIENT OPTIMALITY CONDITIONS FOR DISCRETE MINMAX FRACTIONAL PROGRAMMING PROBLEMS CONTAINING GENERALIZED $({\theta},\;{\eta},\;{\rho})-V-INVEX$ FUNCTIONS AND ARBITRARY NORMS

  • Zalmai, G.J.
    • Journal of applied mathematics & informatics
    • /
    • 제23권1_2호
    • /
    • pp.1-23
    • /
    • 2007
  • The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized $({\theta},\;{\eta},\;{\rho})-V-invexity$ assumptions for a discrete minmax fractional programming problem involving arbitrary norms.

A Simple Extension of the Global Optimality Condition for Lagrangean Relaxation

  • Cho, Seong-Cheol
    • 한국경영과학회지
    • /
    • 제17권1호
    • /
    • pp.107-112
    • /
    • 1992
  • A slight extension of the classical saddle point and the global optimality condition has been discussed relative to some algorithmic implications. It also involves an economic interpretation which shows satisfying, rather than optimizing, decision making behavior under bounded rationality.

  • PDF

공급사슬 최적화를 위한 다중의 수리적 모델 활용 구조 (Integrating Multiple Mathematical Models for Supply Chain Optimization)

  • 한현수
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2001년도 추계학술대회 논문집
    • /
    • pp.97-100
    • /
    • 2001
  • 제조 기업의 가치사슬 최적화를 위한 전략적, 운영상 의사결정 문제는 수리적 모델을 이용한 DSS의 효과적인 활용을 통하여 해결 될 수 있다. 의사결정 프로세스는 필연적으로 공급사슬의 여러 성과 목표와 관련 조직간의 Trade-off 및 연계관계(Interaction)가 고려되므로 복수의 DSS 활용이 필요하게 된다. 이와 관련하여 본 논문에서는 공급 사슬 전체의 최적화를 위한 다수의 전략적 목표 및 의사결정 프로세스, 연계된 수리적 모델들을 정의하고, 관련 조직 및 성과 지표 별 부분적 최적화(Local Optimality)를 지양하고 전체최적화 (Global Optimality)를 달성하기 위한 DSS Logic을 철강산업 프로세스를 대상으로 수리적 모델들의 분할(Decomposition) 및 통합개념을 통하여 제시하였다.

  • PDF

Parameter estimation of four-parameter viscoelastic Burger model by inverse analysis: case studies of four oil-refineries

  • Dey, Arindam;Basudhar, Prabir Kr.
    • Interaction and multiscale mechanics
    • /
    • 제5권3호
    • /
    • pp.211-228
    • /
    • 2012
  • This paper reports the development of a generalized inverse analysis formulation for the parameter estimation of four-parameter Burger model. The analysis is carried out by formulating the problem as a mathematical programming formulation in terms of identification of the design vector, the objective function and the design constraints. Thereafter, the formulated constrained nonlinear multivariable problem is solved with the aid of fmincon: an in-built constrained optimization solver module available in MatLab. In order to gain experience, a synthetic case-study is considered wherein key issues such as the determination and setting up of variable bounds, global optimality of the solution and minimum number of data-points required for prediction of parameters is addressed. The results reveal that the developed technique is quite efficient in predicting the model parameters. The best result is obtained when the design variables are subjected to a lower bound without any upper bound. Global optimality of the solution is achieved using the developed technique. A minimum of 4-5 randomly selected data-points are required to achieve the optimal solution. The above technique has also been adopted for real-time settlement of four oil refineries with encouraging results.

Optimization of Triple Response Systems by Using the Dual Response Approach and the Hooke-Jeeves Search Method

  • Fan, Shu-Kai S.;Huang, Chia-Fen;Chang, Ko-Wei;Chuang, Yu-Chiang
    • Industrial Engineering and Management Systems
    • /
    • 제9권1호
    • /
    • pp.10-19
    • /
    • 2010
  • This paper presents an extended computing procedure for the global optimization of the triple response system (TRS) where the response functions are nonconvex (nonconcave) quadratics and the input factors satisfy a radial region of interest. The TRS arising from response surface modeling can be approximated using a nonlinear mathematical program involving one primary (objective) function and two secondary (constraints) functions. An optimization algorithm named triple response surface algorithm (TRSALG) is proposed to determine the global optimum for the nondegenerate TRS. In TRSALG, the Lagrange multipliers of target (secondary) functions are computed by using the Hooke-Jeeves search method, and the Lagrange multiplier of the radial constraint is located by using the trust region (TR) method at the same time. To ensure global optimality that can be attained by TRSALG, included is the means for detecting the degenerate case. In the field of numerical optimization, as the family of TR approach always exhibits excellent mathematical properties during optimization steps, thus the proposed algorithm can guarantee the global optimal solution where the optimality conditions are satisfied for the nondegenerate TRS. The computing procedure is illustrated in terms of examples found in the quality literature where the comparison results with a gradient-based method are used to calibrate TRSALG.

THE LAYOUT PROBLEM OF TWO KINDS OF GRAPH ELEMENTS WITH PERFORMANCE CONSTRAINTS AND ITS OPTIMALITY CONDITIONS

  • ZHANG XU;LANG YANHUAI;FENG ENMIN
    • Journal of applied mathematics & informatics
    • /
    • 제20권1_2호
    • /
    • pp.209-224
    • /
    • 2006
  • This paper presents an optimization model with performance constraints for two kinds of graph elements layout problem. The layout problem is partitioned into finite subproblems by using graph theory and group theory, such that each subproblem overcomes its on-off nature about optimal variable. Furthermore each subproblem is relaxed and the continuity about optimal variable doesn't change. We construct a min-max problem which is locally equivalent to the relaxed subproblem and develop the first order necessary and sufficient conditions for the relaxed subproblem by virtue of the min-max problem and the theories of convex analysis and nonsmooth optimization. The global optimal solution can be obtained through the first order optimality conditions.

An Optimality Theoretic Analysis of Tonal Realization in Korean

  • Oh, Mi-Ra
    • 음성과학
    • /
    • 제10권3호
    • /
    • pp.89-101
    • /
    • 2003
  • This paper investigates edge effects on the relationship between the underlying tonal sequence and its surface realization in the IP-final Accentual Phrase within the Optimality Theoretic framework. I will examine the way in which AP tones are aligned with their associated syllables in IP-final position. In Korean. Jun's (1996) 'see-saw effect' does not allow any two identical tones if they are marking a boundary of a prosodic group. A phonetic experiment conducted in this paper suggests that the 'see-saw effect' only apply to H boundary tones. Furthermore, it will be shown that the timing of tonal peaks is determined through the ranking of a set of violable constraints. The AP tonal realization is achieved through the access to the global intonation in a complicated way. In the course of discussion, pitch patterns in IP-medial Accentual Phrase will also be discussed.

  • PDF

동적 프로그래밍에 기반한 윤곽선 근사화를 위한 정점 선택 방법 (Vertex Selection Scheme for Shape Approximation Based on Dynamic Programming)

  • 이시웅;최재각;남재열
    • 대한전자공학회논문지SP
    • /
    • 제41권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.