On “An EOQ model for perishable items under stock-dependent selling rate and time-dependent partial backlogging” by Dye and Ouyang

In 2005, Dye and Ouyang proposed an EOQ model for perishable items under stock-dependent selling rate and time-dependent partial backlogging, and then established the unique optimal solution to the problem when building up inventory is not profitable. However, they did not provide the optimal solution to the problem when building up inventory is profitable. In this note, we establish an appropriate model in which building up inventory is profitable, and then provide an algorithm to find the optimal solution to the problem. A numerical example is used to illustrate the proposed model.     

Optimal use of a self-regenerating controller that decays with use

It is proposed to find an athlete's optimal strategy for running a race of arbitrary lengthX. A mathematical model is set up of the dependence of his physical state at any time upon the history of his efforts up to that time. An explicit optimal effort function is then obtained which minimizes the time taken to complete the race and therefore represents the athlete's optimal strategy.     

Abort landing in windshear: Optimal control problem with third-order state constraint and varied switching structure

Optimal abort landing trajectories of an aircraft under different windshear-downburst situations are computed and discussed. In order to avoid an airplane crash due to severe winds encountered by the aircraft during the landing approach, the minimum altitude obtained during the abort landing maneuver is to be maximized. This maneuver is mathematically described by a Chebyshev optimal control problem. By a transformation to an optimal control problem of Mayer type, an additional state variable inequality constraint for the altitude has to be taken into account; here, its order is three. Due to this altitude constraint, the optimal trajectories exhibit, depending on the windshear parameters, up to four touch points and also up to one boundary arc at the minimum altitude level. The control variable is the angle of attack time rate which enters the equations of motion linearly; therefore, the Hamiltonian of the problem is nonregular. The switching structures also includes up to three singular subarcs and up to two boundary subarcs of an angle of attack constraint of first order. This structure can be obtained by applying some advanced necessary conditions of optimal control theory in combination with the multiple-shooting method. The optimal solutions exhibit an oscillatory behavior, reaching the minimum altitude level several times. By the optimization, the maximum survival capability can also be determined; this is the maximum wind velocity difference for which recovery from windshear is just possible. The computed optimal trajectories may serve as benchmark trajectories, both for guidance laws that are desirable to approach in actual flight and for optimal trajectories may then serve as benchmark trajectories both for guidance schemes and also for numerical methods for problems of optimal control.This paper is dedicated to Professor George Leitmann on the occasion of his seventieth birthday.     

Optimal financing and dividend control of the insurance company with excess-of-loss reinsurance policy

In this paper, we consider an optimal financing and dividend control problem of an insurance company. The management of the insurance company controls the dividends payout, equity issuance and the excess-of-loss reinsurance policy. In our model, the dividends are assumed to be paid out continuously, which is of interest from the perspective of financial modeling. The objective is to find the strategy which maximizes the expected present values of the dividends payout minus the equity issuance up to the time of ruin. We solve the optimal control problem and identify the optimal strategy by constructing two categories of suboptimal control problems.     

Self-dual codes with automorphism of order 3 having 8 cycles

All optimal binary self-dual codes which have an automorphism of order 3 with 8 independent cycles are obtained up to equivalence.     

Value-Estimation Function Method for Constrained Global Optimization

A novel value-estimation function method for global optimization problems with inequality constraints is proposed in this paper. The value-estimation function formulation is an auxiliary unconstrained optimization problem with a univariate parameter that represents an estimated optimal value of the objective function of the original optimization problem. A solution is optimal to the original problem if and only if it is also optimal to the auxiliary unconstrained optimization with the parameter set at the optimal objective value of the original problem, which turns out to be the unique root of a basic value-estimation function. A logarithmic-exponential value-estimation function formulation is further developed to acquire computational tractability and efficiency. The optimal objective value of the original problem as well as the optimal solution are sought iteratively by applying either a generalized Newton method or a bisection method to the logarithmic-exponential value-estimation function formulation. The convergence properties of the solution algorithms guarantee the identification of an approximate optimal solution of the original problem, up to any predetermined degree of accuracy, within a finite number of iterations.     

运用因子分析法建立教学质量评估指标体系

在大量抽样调查的基础上，本文运用因子分析（Ｆａｃｔｏｒ Ａｎａｌｙｓｉｓ）的方法，在Ｍ—３４０计算机上利用ＡＮＡＬＹＳＴ统计分析软件包中因子分析软件程序，求得因子载荷矩阵．依据因子载荷矩阵，并结合教学质量评估的特点，建立起适用于学生为参评者的教学质量评估指标体系．     

Constraint-based search for optimal Golomb rulers

Finding optimal Golomb rulers is an extremely challenging combinatorial problem. The distance between each pair of mark is unique in a Golomb ruler. For a given number of marks, an optimal Golomb ruler has the minimum length. Golomb rulers are used in application areas such as X-ray crystallography, radio astronomy, information theory, and pulse phase modulation. The most recent optimal Golomb ruler search algorithm hybridises a range of techniques such as greedy randomised adaptive search, scatter search, tabu search, clustering techniques, and constraint programming, and obtains optimal Golomb rulers of up to 16 marks with very low success rates. In this paper, we provide tight upper bounds for Golomb ruler marks and present heuristic-based effective domain reduction techniques. Using these along with tabu and configuration checking meta-heuristics, we then develop a constraint-based multi-point local search algorithm to perform a satisfaction search for optimal Golomb rulers of specified length. We then present an algorithm to perform an optimisation search that minimises the length using the satisfaction search repeatedly. Our satisfaction search finds optimal Golomb rulers of up to 19 marks while the optimisation search finds up to 17 marks.     

Global Optimization on an Interval

This paper provides expressions for solutions of a one-dimensional global optimization problem using an adjoint variable which represents the available one-sided improvements up to the interval “horizon.” Interpreting the problem in terms of optimal stopping or optimal starting, the solution characterization yields two-point boundary problems as in dynamic optimization. Results also include a procedure for computing the adjoint variable, as well as necessary and sufficient global optimality conditions.