• Title/Summary/Keyword: Nonlinear Programming Problem

Search Result 273, Processing Time 0.025 seconds

Fuzzy 계확법의 해법일반화에 관한 연구 (A Study on the Extension of Fuzzy Programming Solution Method)

  • 양태용;김현준
    • 한국경영과학회지
    • /
    • 제11권1호
    • /
    • pp.36-43
    • /
    • 1986
  • In this study, the fuzzy programming is extended to handle various types of membership functions by transformation of the complicated fuzzy programming problems into the equivalent crisp linear programming problems with single objective. It is well-known that the fuzzy programming problem with linear membership functions (i.e., ramp type) can be easily transformed into a linear programming problem by introducing one dummy variable to minimize the worst unwanted deviation. However, until recently not many researches have been done to handle various general types of complicated linear membership functions which might be more realistic than ramp-or triangular-type functions. In order to handle these complicated membership functions, the goal dividing concept, which is based on the fuzzy set operation (i. e., intersection and union operations), has been prepared. The linear model obtained using the goal dividing concept is more efficient and single than the previous models [4, 8]. In addition, this result can be easily applied to any nonlinear membership functions by piecewise approximation since the membership function is continuous and monotone increasing or decreasing.

  • PDF

다층 셀룰라 비선형 회로망(CNN)을 이용한 고속 패턴 분류 (Fast Pattern Classification with the Multi-layer Cellular Nonlinear Networks (CNN))

  • 오태완;이혜정;손홍락;김형석
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제52권9호
    • /
    • pp.540-546
    • /
    • 2003
  • A fast pattern classification algorithm with Cellular Nonlinear Network-based dynamic programming is proposed. The Cellular Nonlinear Networks is an analog parallel processing architecture and the dynamic programing is an efficient computation algorithm for optimization problem. Combining merits of these two technologies, fast pattern classification with optimization is formed. On such CNN-based dynamic programming, if exemplars and test patterns are presented as the goals and the start positions, respectively, the optimal paths from test patterns to their closest exemplars are found. Such paths are utilized as aggregating keys for the classification. The algorithm is similar to the conventional neural network-based method in the use of the exemplar patterns but quite different in the use of the most likely path finding of the dynamic programming. The pattern classification is performed well regardless of degree of the nonlinearity in class borders.

Multiple-loading condition을 고려한 구조체의 위상학적 최적화 (Topological Structural Optimization under Multiple-Loading Conditions)

  • 박재형;홍순조;이리형
    • 전산구조공학
    • /
    • 제9권3호
    • /
    • pp.179-186
    • /
    • 1996
  • 본 연구에서는 구조체의 위상학적 최적화를 위한 비선형 formulation(NLP)가 개발, 검토되었다. 이 NLP는 multiple-loading하에서 임의의 오브젝티브 함수, 응력, 변위 제약조건들을 쉽게 다룰 수가 있다. 또한 이 NLP는 해석과 최적화 디자인을 동시에 실시함으로써 요소 사이즈가 영으로 접근함에 따른 강성 매트릭스의 singularity를 피할 수 있다. 즉, 평형 방정식을 등제약조건으로 치환함으로써 강성 매트릭스 그 자체나 그의 역매트릭스를 구할 필요도 없어진다. 이 NLP는 multiple-loading conditon하에서 테스트되었으며, 이를 통해 이 NLP가 다양한 제약조건하에서 강력하게 작용함이 입증되었다.

  • PDF

Energy Efficiency Resource Allocation for MIMO Cognitive Radio with Multiple Antenna Spectrum Sensing

  • Ning, Bing;Yang, Shouyi;Mu, Xiaomin;Lu, Yanhui;Hao, Wanming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권11호
    • /
    • pp.4387-4404
    • /
    • 2015
  • The energy-efficient design of sensing-based spectrum sharing of a multi-input and multi-output (MIMO) cognitive radio (CR) system with imperfect multiple antenna spectrum sensing is investigated in this study. Optimal resource allocation strategies, including sensing time and power allocation schemes, are studied to maximize the energy efficiency (EE) of the secondary base station under the transmit power and interference power constraints. EE problem is formulated as a nonlinear stochastic fractional programming of a nonconvex optimal problem. The EE problem is transformed into its equivalent nonlinear parametric programming and solved by one-dimension search algorithm. To reduce searching complexity, the search range was founded by demonstration. Furthermore, simulation results confirms that an optimal sensing time exists to maximize EE, and shows that EE is affected by the spectrum detection factors and corresponding constraints.

A Study on Earth-Moon Transfer Orbit Design

  • No, Tae-Soo;Lee, Ji-Marn;Jeon, Gyeong-Eon;Lee, Dae-Ro;Kim, Ghang-Ho
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제13권1호
    • /
    • pp.106-116
    • /
    • 2012
  • Optimal transfer trajectories based on the planar circular restricted three body problem are designed by using mixed impulsive and continuous thrust. Continuous and dynamic trajectory optimization is reformulated in the form of discrete optimization problem. This is done by the method of direct transcription and collocation. It is then solved by using nonlinear programming software. Two very different transfer trajectories can be obtained by the different combinations of the design parameters. Furthermore, it was found out that all designed trajectories permit a ballistic capture by the Moon's gravity. Finally, the required thrust profiles are presented and they are analyzed in detail.

A Transportation Problem with Uncertain Truck Times and Unit Costs

  • Mou, Deyi;Zhao, Wanlin;Chang, Xiaoding
    • Industrial Engineering and Management Systems
    • /
    • 제12권1호
    • /
    • pp.30-35
    • /
    • 2013
  • Motivated by the emergency scheduling in a transportation network, this paper considers a transportation problem, in which, the truck times and transportation costs are assumed as uncertain variables. To meet the demand in the practical applications, two optimization objectives are considered, one is the total costs and another is the completion times. And then, a multi-objective optimization model is developed according to the situation in applications. Because there are commensurability and conflicting between the two objectives commonly, a solution does not necessarily exist that is best with respective to the two objectives. Therefore, the problem is reduced to a single objective model, which is an uncertain programming with a chance-constrain. After some analysis, its equivalent deterministic form is obtained, which is a nonlinear programming. Based on a stepwise optimization strategy, a solution method is developed to solve the problem. Finally, the computational results are provided to demonstrate the effectiveness of our model and algorithm.

MULTIOBJECTIVE CONTINUOUS PROGRAMMING CONTAINING SUPPORT FUNCTIONS

  • Husain, I.;Ahmed, A.;Rumana, G. Mattoo
    • Journal of applied mathematics & informatics
    • /
    • 제27권3_4호
    • /
    • pp.603-619
    • /
    • 2009
  • Wolfe and Mond-Weir type dual to a nondifferentiable continuous programming containing support functions are formulated and duality is investigated for these two dual models under invexity and generalized invexity. A close relationship of our duality results with those of nondifferentiable nonlinear programming problem is also pointed out.

  • PDF

Advanced controller design for AUV based on adaptive dynamic programming

  • Chen, Tim;Khurram, Safiullahand;Zoungrana, Joelli;Pandey, Lallit;Chen, J.C.Y.
    • Advances in Computational Design
    • /
    • 제5권3호
    • /
    • pp.233-260
    • /
    • 2020
  • The main purpose to introduce model based controller in proposed control technique is to provide better and fast learning of the floating dynamics by means of fuzzy logic controller and also cancelling effect of nonlinear terms of the system. An iterative adaptive dynamic programming algorithm is proposed to deal with the optimal trajectory-tracking control problems for autonomous underwater vehicle (AUV). The optimal tracking control problem is converted into an optimal regulation problem by system transformation. Then the optimal regulation problem is solved by the policy iteration adaptive dynamic programming algorithm. Finally, simulation example is given to show the performance of the iterative adaptive dynamic programming algorithm.

A NEW METHOD FOR SOLVING NONLINEAR SECOND ORDER PARTIAL DIFFERENTIAL EQUATIONS

  • Gachpazan. M.;Kerayechian, A.;Kamyad, A.V.
    • Journal of applied mathematics & informatics
    • /
    • 제7권2호
    • /
    • pp.453-465
    • /
    • 2000
  • In this paper, a new method for finding the approximate solution of a second order nonlinear partial differential equation is introduced. In this method the problem is transformed to an equivalent optimization problem. them , by considering it as a distributed parameter control system the theory of measure is used for obtaining the approximate solution of the original problem.

Optimization Analysis of Trajectory for Re-Entry Vehicle Using Global Orthogonal Polynomial

  • Lee Dae-Woo
    • Journal of Mechanical Science and Technology
    • /
    • 제20권10호
    • /
    • pp.1557-1566
    • /
    • 2006
  • We present a procedure for the application of global orthogonal polynomial into an atmospheric re-entry maneuvering problem. This trajectory optimization is imbedded in a family of canonically parameterized optimal control problem. The optimal control problem is transcribed to nonlinear programming via global orthogonal polynomial and is solved a sparse nonlinear optimization algorithm. We analyze the optimal trajectories with respect to the performance of re-entry maneuver.