Lot‐sizing policies for deterioration items under two‐level trade credit with partial trade credit to credit‐risk retailer and limited storage capacity

The main purpose of this article is to investigate the optimal wholesaler's replenishment decisions for deterioration items under two levels of the trade credit policy and two storage facilities in order to reflect the supply chain management situation within the economic order quantity framework. In this study, each of the following assumptions have been made: (1) The own warehouse with limited capacity always is not sufficient to store the order quantity, so that a rented warehouse is needed to store the excess units over the capacity of the own warehouse; (2) The wholesaler always obtains the partial trade credit, which is independent of the order quantity offered by the supplier, but the wholesaler offers the full trade credit to the retailer; (3) The wholesaler must take a loan to pay his or her supplier the partial payment immediately when the order is received and then pay off the loan with the entire revenue. Under these three conditions, the wholesaler can obtain the least costs. Furthermore, this study models the wholesaler's optimal replenishment decisions under the aforementioned conditions in the supply chain management. Two theorems are developed to efficiently determine the optimal replenishment decisions for the wholesaler. Finally, numerical examples are given to illustrate the theorems that are proven in this study, and the sensitivity analysis with respect to the major parameters in this study is performed. Copyright © 2016 John Wiley & Sons, Ltd.     

Numerical solution of minimax problems of optimal control,part 1

This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance.     

Numerical solution of minimax problems of optimal control,part 2

In a previous paper (Part 1), we presented general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We considered two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).In this paper, the transformation techniques presented in Part 1 are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer. Both the single-subarc approach and the multiple-subarc approach are employed. Three test problems characterized by known analytical solutions are solved numerically.It is found that the combination of transformation techniques and sequential gradient-restoration algorithm yields numerical solutions which are quite close to the analytical solutions from the point of view of the minimax performance index. The relative differences between the numerical values and the analytical values of the minimax performance index are of order 10^–3 if the single-subarc approach is employed. These relative differences are of order 10^–4 or better if the multiple-subarc approach is employed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance.     

On L(d,1)-labelings of graphs

Given a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assigns to each vertex of G a non-negative integer such that if two vertices u and v are adjacent, then |f(u)−f(v)|d; if u and v are not adjacent but there is a two-edge path between them, then |f(u)−f(v)|1. The L(d,1)-number of G, λ_d(G), is defined as the minimum m such that there is an L(d,1)-labeling f of G with f(V){0,1,2,…,m}. Motivated by the channel assignment problem introduced by Hale (Proc. IEEE 68 (1980) 1497–1514), the L(2,1)-labeling and the L(1,1)-labeling (as d=2 and 1, respectively) have been studied extensively in the past decade. This article extends the study to all positive integers d. We prove that λ_d(G)Δ²+(d−1)Δ for any graph G with maximum degree Δ. Different lower and upper bounds of λ_d(G) for some families of graphs including trees and chordal graphs are presented. In particular, we show that the lower and the upper bounds for trees are both attainable, and the upper bound for chordal graphs can be improved for several subclasses of chordal graphs.     

Wiener–Itô Theorem in Terms of Wick Tensors

Wick tensors are used to describe homogeneous chaos and to define multiple Wiener integrals. The Wiener–Itô decomposition is expressed by the formula $$\varphi (x) = \sum\limits_{n = 0}^\infty {\frac{1}{{n!}}\int_B {[D^n (\mu \varphi )(0)]^ \sim}} (x + iy,...,x + iy)d\mu (y)$$ . We use this formula to interpret Hida's original idea of generalized multiple Wiener integrals as generalized functions acting on the space of test functions.     

A delta white noise functional

The additive renormalization% MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaabs7adaWgaaWcbaGaaeySdiaab6cacaqG0bqefeKCPfgBaGqb% diaa-bcaaeqaaOGaeyypa0Jaa8hiaiaacIcacaaIYaGaeqiWdaNaai% ykamaaCaaaleqabaGaeyOeI0IaaGymaiaac+cacaaIYaaaaGqadOGa% a4hiaiGacwgacaGG4bGaaiiCaiaacIcacqGHsislcaqGXoWaaWbaaS% qabeaacaqGYaaaaOGaai4laiaaikdacaGGPaGaa4hiaiaacQdaciGG% LbGaaiiEaiaacchacqGHXcqSdaWadiqaaiabgkHiTiaadkeacaGGNa% GaaiikaiaadshacaGGPaWaaWbaaSqabeaacaaIYaaaaOGaai4laiaa% ikdacaGFGaGaey4kaSIaa4hiaiaabg7acaWGcbGaai4jaiaacIcaca% WG0bGaaiykaaGaay5waiaaw2faaiaacQdaaaa!6C5C!\[{\rm{\delta }}_{{\rm{\alpha }}{\rm{.t}} } = (2\pi )^{ - 1/2} \exp ( - {\rm{\alpha }}^{\rm{2}} /2) :\exp \pm \left[ { - B'(t)^2 /2 + {\rm{\alpha }}B'(t)} \right]:\]is shown to be a generalized Brownian functional. Some of its properties are derived. is shown to be a generalized Brownian functional. Some of its properties are derived.On leave from Universidade do Minho, Area de Matematica, Largo Carlos Amarante, P-4700 Braga, Portugal.     

Integration of particle swarm optimization-based fuzzy neural network and artificial neural network for supplier selection

This study is intended to develop an intelligent supplier decision support system which is able to consider both the quantitative and qualitative factors. It is composed of (1) the collection of quantitative data such as profit and productivity, (2) a particle swarm optimization (PSO)-based fuzzy neural network (FNN) to derive the rules for qualitative data, and (3) a decision integration model for integrating both the quantitative data and fuzzy knowledge decision to achieve the optimal decision. The results show that the decision support system developed in this study make more precise and favorable judgments in selecting suppliers after taking into account both qualitative and quantitative factors.     

Experimental comparison between intensity and phase detection sensitivities of grating coupling surface plasmon resonance

This paper experimentally compares the intensity and phase detection sensitivities of grating coupling surface plasmon resonance (SPR). A simple air-heating method is proposed to implement tiny refractive index changes. An electro-optic heterodyne interferometer is used to obtain both the intensity and phase curves of the grating coupling SPR device. The transient reflectivity and phase curves during the heating process are recorded. The result shows that the phase detection sensitivity is much better than that of the intensity by an order of magnitude.     

Hydrogen-bond topology and the ice VII/VIII and ice Ih/XI proton-ordering phase transitions

The existence of an ice Ih/XI proton-ordering transition to a low-temperature ferroelectric phase has sparked considerable debate in the literature. Electronic density functional theory calculations, extended using graph invariants, confirm that a transition to a low-temperature ferroelectric phase should occur. The predicted transition at 98 K is in qualitative agreement with the observed transition at 72 K, and the low-temperature phase is the ferroelectric phase determined in diffraction experiments. The theoretical methods used to predict the phase transition are validated by comparing their prediction to the well-characterized ice VII/VIII proton-ordering transition.     

A Bayesian analysis for the seismic data on Taiwan

A Bayesian approach is used to analyze the seismic events with magnitudes at least 4.7 on Taiwan. Following the idea proposed by Ogata (1988,Journal of the American Statistical Association,83, 9–27), an epidemic model for the process of occurrence times given the observed magnitude values is considered, incorporated with gamma prior distributions for the parameters in the model, while the hyper-parameters of the prior are essentially determined by the seismic data in an earlier period. Bayesian inference is made on the conditional intensity function via Markov chain Monte Carlo method. The results yield acceptable accuracies in predicting large earthquake events within short time periods.