On the convexity for the expected total cost per unit time of the EPQ model with scrap,rework and stochastic machine breakdown

This study explores the economic production quantity model with scrap, rework and stochastic machine breakdown. The main purpose of this paper is twofold:(P1) This paper will adopt the rigorous methods of mathematics to demonstrate that the expected total cost per unit time is convex on all positive numbers to improve the conditional convexity in Theorem 1 of Chiu et al. (2010) [7].(P2) This paper gives the concrete proof to provide bounds for the optimal production run time to remove the logical shortcomings of mathematics presented in proof of Theorem 2 of Chiu et al. (2010) [7].     

Remarks on the optimization process of a manufacturing system with stochastic breakdown and rework

This paper reexamines the optimization process of a manufacturing system with stochastic breakdown and rework proposed by Chiu [S.W. Chiu, An optimization problem of manufacturing systems with stochastic machine breakdown and rework process, Applied Stochastic Models in Business and Industry 24 (2008) 203–219]. The proof of convexity of the long-run average cost function for the aforementioned manufacturing system is provided in this note. It can be used to replace the conditional convexity given in Theorem 1 of Chiu (2008) [1]. Therefore, when determining the optimal solution for such a real-life system, computational efforts in verifying the conditional convexity can now be omitted, due to the improved quality of the optimization process.     

Remarks on the optimization method of a manufacturing system with stochastic breakdown and rework process in supply chain management

Chiu et al. (2010) [8] present the proof of convexity of the long-run average cost function E[TCU(t₁)] for a manufacturing system with stochastic breakdown and rework process. This note not only demonstrates that E[TCU(t₁)] is not convex but also adopts the rigorous methods of mathematics to develop the complete solution procedure to find the optimal solution for removing shortcomings of the above paper mentioned.     

Partial backlogging inventory lot-size models for deteriorating items with fluctuating demand under inflation

In this paper, the traditional inventory lot-size model is extended to allow not only for general partial backlogging rate but also for inflation. The assumptions of equal cycle length and constant shortage length imposed in the model developed by Moon et al. [Moon, I., Giri, B.C., Ko, B., 2005. Economic order quantity models for ameliorating/deteriorating items under inflation and time discounting, European Journal of Operational Research 162(3), 773–785] are also relaxed. For any given number of replenishment cycles the existence of a unique optimal replenishment schedule is proved and further the convexity of the total cost function of the inventory system in the number of replenishments is established. The theoretical results here amend those in Yang et al. [Yang, H.L., Teng, J.T., Chern, M.S., 2001. Deterministic inventory lot-size models under inflation with shortages and deterioration for fluctuating demand, Naval Research Logistics 48(2), 144–158] and provide the solution to those two counterexamples by Skouri and Papachristos [Skouri, K., Papachristos, S., 2002. Note on “deterministic inventory lot-size models under inflation with shortages and deterioration for fluctuating demand” by Yang et al. Naval Research Logistics 49(5), 527–529.]. Finally we propose an algorithm to find the solution, and obtain some managerial results by using sensitivity analyses.     

A simple cost minimization procedure for the (Q, r) inventory system with a specified fixed cost per stockout occasion

For fast-moving A items, Silver et al. [E.A. Silver, D.F. Pyke, R. Peterson, Inventory Management and Production Planning and Scheduling, third ed., John Wiley & Sons, New York, NY, 1998] explore the (Q, r) inventory system with a specified cost per stockout occasion. However, a number of difficulties have impeded the implement of their solution procedure. That is, the total relevant cost function is not convex in general, so the convergence of the Silver et al.’s solution procedure to the optimal solution of the total relevant cost function is not necessarily true. An easier and more accurate solution procedure is proposed to overcome the shortcoming of the Silver et al.’s solution procedure.     

Comment: A new blind signature based on the discrete logarithm problem for untraceability

In 2004, Lee et al. [C.C. Lee, M.S. Hwang, W.P. Yang, A new blind signature based on the discrete logarithm problem for untraceability, Appl. Math. Comput., in press] proposed a new untraceable blind signature based on DLP in order to overcome the “security limits” of Carmenisch et al.’s scheme. However, we show there are two mistakes in [C.C. Lee, M.S. Hwang, W.P. Yang, A new blind signature based on the discrete logarithm problem for untraceability, Appl. Math. Comput., in press]: 1. The Carmenisch et al.’s scheme does meet the requirement of untraceability and the cryptanalysis proposed by Lee et al. is not correct; 2. Though Lee et al.’s scheme is untraceable, the proof of its untraceability in [C.C. Lee, M.S. Hwang, W.P. Yang, A new blind signature based on the discrete logarithm problem for untraceability, Appl. Math. Comput., in press] is wrong (in this paper we also give the correct proof of its untraceability). So Lee et al.’s scheme does not have any advantage and it is unpractical since the cost of the scheme is higher compared with Carmenisch et al.’s scheme.     

Production lot size problem with failure in repair and backlogging derived without derivatives

Conventional approaches for solving the production lot size problems are by using the differential calculus on the long-run average production-inventory cost function with the need to prove optimality first. This note presents a simple algebraic method to replace the use of calculus for determining the optimal lot size. This study refers to the approach used by Grubbström and Erdem [Grubbström, R.W., Erdem, A., 1999. The EOQ with backlogging derived without derivatives, International Journal of Production Economics 59, 529–530] and extends it to the model examined by Chiu and Chiu [Chiu, S.W., Chiu, Y.-S.P., 2006. Mathematical modelling for production system with backlogging and failure in repair. Journal of Scientific and Industrial Research 65(6), 499–506]. This paper demonstrates that the lot size solution and the optimal production-inventory cost of an imperfect EMQ model can be derived without derivatives. As a result, the practitioners or students with little or no knowledge of calculus may be able to manage or understand with ease the realistic production systems.     

Graphs With Least Eigenvalue —2: A New Proof of the 31 Forbidden Subgraphs Theorem

Generalized line graphs were introduced by Hoffman Proc. Calgary Internat. Conf. on Combinatorial Structures and their applications, Gordon and Breach, New York (1970); they were characterized in 1980 by a collection of 31 forbidden induced subgraphs, obtained independently by Cvetkovi et al., Comptes Rendus Math. Rep. Acad. Sci. Canada (1980) and S. B. Rao et al., Proc. Second Symp., Indian Statistical Institute, Calcutta, Lecture Notes in Math., (1981). Here a short new proof of this characterization theorem is given, based on an edge-colouring technique.     

On optimal batch sizing in a multi-stage production system with rework consideration

Recently, Sarker et al. [Sarker, B.R., Jamal, A.M.M., Mondal, S., 2008. Optimal batch sizing in a multi-stage production system with rework consideration. European Journal of Operational Research 184(3) 915–929] presented an EPQ inventory model for a multi-stage manufacturing system with rework process; basically they proposed two operational inventory policies. In the paper, there are some mathematical expressions which are to be corrected. At first, this paper presents the mathematical expressions corrected and the appropriate solution to the numerical example. We also established the closed forms for the optimal total inventory cost, the conditions for which there is an optimal solution, and the mathematical expressions for determining the total additional cost for working with a non optimal solution for both policies that were not given by Sarker et al. (2008).     

Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, “The disjunctive procedure and blocker duality”

Aguilera et al. [Discrete Appl. Math. 121 (2002) 1–13] give a generalization of a theorem of Lehman through an extension of the disjunctive procedure defined by Balas, Ceria and Cornuéjols. This generalization can be formulated as(A) For every clutter , the disjunctive index of its set covering polyhedron coincides with the disjunctive index of the set covering polyhedron of its blocker, .In Aguilera et al. [Discrete Appl. Math. 121 (2002) 1–3], (A) is indeed a corollary of the stronger result(B) .Motivated by the work of Gerards et al. [Math. Oper. Res. 28 (2003) 884–885] we propose a simpler proof of (B) as well as an alternative proof of (A), independent of (B). Both of them are based on the relationship between the “disjunctive relaxations” obtained by and the set covering polyhedra associated with some particular minors of .     

An improved solution to the replenishment policy for the EMQ model with rework and multiple shipments

Recently, Chiu et al. (2012) [1] present an alternative optimization procedure to derive the optimal replenishment lot size for an economic manufacturing quantity (EMQ) model with rework and multiple shipments. This inventory model was proposed by Chiu et al. (2011) [2]. Both papers do not consider the determining of the number of shipments. This paper determines both the optimal replenishment lot size and the optimal number of shipments jointly. The solution of this paper is better than the solutions of Chiu et al.  and .     

关于向量优化问题的Δ函数标量化刻画的某些注记

近期,夏远梅等(重庆师范大学（自然科学版）,2015,32(1):12-15)利用Δ函数通过非线性标量化方法研究了向量优化问题的?-真有效解并举例说明了主要结果.笔者指出:其定理1是Gao等(Journal of Industrial and Management Optimization,2011,7（2）: 483-496)建立的定理4.6(i)的特例;其定理2的证明存在不足.通过研究一般的(C,ε)-真有效解的Δ函数非线性标量化,给出了定理2的严谨证明.最后,在?-真有效解存在的情况下举例说明了主要结果.     

On the Existence of Optimal Solutions to an Optimal Control Problem

In this paper, some results concerning the existence of optimal solutions to an optimal control problem are derived. The problem involves a quasilinear hyperbolic differential equation with boundary condition and a nonlinear integral functional of action. The assumption of convexity, under which the main theorem is proved, is not connected directly with the convexity of the functional of action. In the proof, the implicit function theorem for multimappings is used.Communicated by L. D. Berkovitz     

A generalized Isserlis theorem for location mixtures of Gaussian random vectors

In a recent paper (Michalowicz et al., 2011), Michalowicz et al. provide an extension of the Isserlis theorem to the case of a Rademacher location mixture of a Gaussian vector. This theorem is known to physicists under the name of Wick’s theorem. We generalize here this result to the case of any location mixture of Gaussian vector; we also provide an example of the extension of the Isserlis theorem to a “scale-location” mixture of Gaussian, namely, the d-dimensional generalized hyperbolic distribution.     

A convexity theorem for three tangled Hamiltonian torus actions,and super-integrable systems

A completely integrable system on a symplectic manifold is called super-integrable when the number of independent integrals of motion is more than half the dimension of the manifold. Several important completely integrable systems are super-integrable: the harmonic oscillators, the Kepler system, the non-periodic Toda lattice, etc. Motivated by an additional property of the super-integrable system of the Toda lattice (Agrotis et al., 2006) [2], we will give a generalization of the Atiyah and Guillemin–Sternberg?s convexity theorem.     

A note on optimal ordering policies when the supplier provides a progressive interest scheme

Goyal et al. [Goyal, S.K., Teng, J.T., Chang, C.T., 2007. Optimal ordering policies when the supplier provides a progressive interest scheme. European Journal of Operational Research 179, 404–413] explore optimal ordering policies when the supplier provides a progressive interest scheme. The main purpose of this paper is fourfold:

(1)

This paper simplifies the total relevant cost per year Z(T) of Goyal et al. (2007) such that we can locate the optimal solutions of Z(T) by an easier way.     

The simplest proof of Lieb concavity theorem

In this paper, by applying jointly concavity and jointly convexity of generalized perspective of some elementary functions, we give the simplest proof of the well-known Lieb concavity theorem and Ando convexity theorem.     

Four applications of majorization to convexity in the calculus of variations

The resemblance between the Horn-Thompson theorem and a recent theorem by Dacorogna-Marcellini-Tanteri indicates that Schur-convexity and the majorization relation are relevant for applications in the calculus of variations and its related notions of convexity, such as rank one convexity or quasiconvexity. In Theorem 6.6, we give simple necessary and sufficient conditions for an isotropic objective function to be rank one convex on the set of matrices with positive determinant.Majorization is used in order to give a very short proof of a theorem of Thompson and Freede [R.C. Thompson, L.J. Freede, Eigenvalues of sums of Hermitian matrices III, J. Res. Nat. Bur. Standards B 75B (1971) 115-120], Ball [J.M. Ball, Constitutive inequalities and existence theorems in nonlinear elastostatics, in: R.J. Knops (Ed.), Nonlinear Analysis and Mechanics: Heriot-Watt Symposium, vol. 1, Res. Notes Math., 17, Pitman, 1977, pp. 187-241], or Le Dret [H. Le Dret, Sur les fonctions de matrices convexes et isotropes, CR Acad. Sci. Paris, Série I 310 (1990) 617-620], concerning the convexity of a class of isotropic functions which appear in nonlinear elasticity.Next we prove (Theorem 7.3) a lower semicontinuity result for functionals with the form _∫Ωw(D?(x))dx, with w(F)=h(lnV_F). Here F=R_FU_F=V_FR_F is the usual polar decomposition of F∈gl(n,R), and lnV_F is Hencky’s logarithmic strain.We close this paper with a compact proof of Dacorogna-Marcellini-Tanteri theorem, based only on classical results about majorization. The mentioned resemblance of this theorem with the Horn-Thompson theorem is thus explained.     

A simple proof of the approximation by real analytic Lipschitz functions

A theorem in Azagra et al. (preprint) [1] asserts that on a real separable Banach space with separating polynomial every Lipschitz function can be uniformly approximated by real analytic Lipschitz function with a control over the Lipschitz constant. We give a simple proof of this theorem.