• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.355-369
• /
• 2004

The paper determines by control-theoretic means the optimal dose of fertilizer to be used to two plants for maintaining optimal revival of their growths, which are retarded mainly due to the toxicity contributed by the plants jointly.

• 전기의세계
• /
• 제27권2호
• /
• pp.53-63
• /
• 1978

The problem of optimally controlling a time-delay control system to a function as the final target is inverstigated. Necessary conditions are presented in the form of Pontryagin's maximum principle, and it is further shown that they are also sufficient for linear systems with a convex cost functional. Several examples are given to illustrate the results.

• 전기의세계
• /
• 제27권6호
• /
• pp.58-62
• /
• 1978

The problem of optimal shutdown control of nuclear reactor having nonlinear dynamics is considered. Since the problem, being a bounded state space problem, is difficult to solve by conventional analytic methods such as Pontryagin's maximum principle, it is approached directly by the quasilinearization technique, and solved numerically. The solution obtained in this manner proves to be an improvement over the previous results.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.301-322
• /
• 2003

The paper considers two mutually independent pests in presence of their common predator and discusses their control biologically by release of additional predators and chemically by using non-selective non-residual pesticide. It also verifies the results by special choice of parameters.

• 산업경영시스템학회지
• /
• 제10권16호
• /
• pp.113-119
• /
• 1987

다단계 생산-재고문제에 관하여 일반적인 해법으로서 Dynamic Programming이 이용되고 있으나 C. L. Hwang과 L. T. Fan은 Pontryagin의 최대원리에 의해 보다 효율적인 방법을 제시하였다. 본 연구는 상기의 문제를 제품의 진부화가 있는 모델로 확장하여 난산형 최대원리를 적용하는 것으로서, 특히 수요 및 진부화율이 기간마다 변화하는 다단계 생산-재고시스템에 있어서의 최적 생산-재고정책을 수립하는 효율적인 앨고리듬을 제시한다.

• Korean Journal of Mathematics
• /
• 제23권2호
• /
• pp.283-291
• /
• 2015

In the optimal control problem, at first we search the expected optimal solution by using Pontryagin type's necessary conditions called the maximum principle. Next we use the sufficient conditions to conclude that the searched solution is optimal. In this article the sufficient conditions are studied. The value function is used for sufficient conditions.

• 전기의세계
• /
• 제18권6호
• /
• pp.9-22
• /
• 1969

This thesis has suggested a method of applying the Maximum Principle of Pontryagin to the optimal control of distributive electrical networks. In general, electrical networks consist of branches, nodes, sources and loads. The effective values of steady state currents and voltages are independent of time but only expressed as the functions of position. Moreover, most of the node voltages and branch currents are not predetermined, that is, initially unknown, and their inherent loop characteristics satisfy only Kirchhoff's current and voltage laws. The Maximum Principle, however, needs the initial fixed values of all state variables for its standand way of application. In spite of this inconsistency this thesis has undertaken to suggest a new approach to the successful solution of the above mentioned networks by introducing scaling factors and a state variable change technique which transform the boundary-value unknown problem into the boundary-value partially fixed and partially free problem. For the examples of applying the method suggested, the control problems for minimizing copper quantity in a distribution line have been solved with voltage drop constraint imposed on. In the case of uniform load distribution it has been shown that the optimal wire diameter of the distribution line is reciprocally proportional to the root of distance. For the same load pattern as above the wire diameter giving the minimum copper loss in the distribution line has been shown to be reciprocally proportional to distance.

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.835-850
• /
• 1999

The present paper deals with the problem of nonselective harvesting in a partly infected prey and predator system in which both the susceptible prey and the predator follow the law of logistic growth and some preys avoid predation by hiding. The dynamical behaviour of the system has been studied in both the local and global sense. The optimal policy of exploitation has been derived by using Pontraygin's maximal principle. Numerical analysis and computer simulation of the results have been performed to investigate the golbal properties of the system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.419-424
• /
• 1991

In this paper, a fuel minimizing closed loop explicit inertial guidance algorithm for the orbit injection of a rocket is developed. In this formulation, the fuel burning rate and magnitude of thrust are assumed constant, and the motion of a rocket is assumed to be subject to the average inverse-square gravity, but with negligible atmospheric effects. The optimum thrust angle for obtaining the given velocity vector in the shortest time with minimizing fuel consumption is first determined, and then the additive thrust angle for targeting the final position vectors is determined by using Pontryagin's Maximum Principle. To establish the real time processing, many algorithms of the onboard guidance software are simplified. Simulations for the explicit guidance algorithm, for the 2nd-stage flight of the N-1 rocket, are carried out. The results show that the guidance algorithm works well in the presence of the maximum .+-.10 % initial velocity and altitude error. The effects of the guidance cycle time is also examined.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2202-2217
• /
• 2012

The transmission opportunities between nodes in Delay Tolerant Network (DTNs) are uncertain, and routing algorithms in DTNs often need nodes serving as relays for others to carry and forward messages. Due to selfishness, nodes may ask the source to pay a certain reward, and the reward may be varying with time. Moreover, the reward that the source obtains from the destination may also be varying with time. For example, the sooner the destination gets the message, the more rewards the source may obtain. The goal of this paper is to explore efficient ways for the source to maximize its total reward in such complex applications when it uses the probabilistic two-hop routing policy. We first propose a theoretical framework, which can be used to evaluate the total reward that the source can obtain. Then based on the model, we prove that the optimal forwarding policy confirms to the threshold form by the Pontryagin's Maximum Principle. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical framework. Furthermore, we demonstrate that the performance of the optimal forwarding policy with threshold form is better through extensive numerical results, which conforms to the result obtained by the Maximum Principle.