The classic newsvendor problem focuses on maximizing the expected profit or minimizing the expected cost when the newsvendor faces myopic customers. However, it ignores the customer’s bargain-hunting behavior and risk preference measure of the newsvendor. As a result, we carry out the rational expectation (RE) equilibrium analysis for risk-averse newsvendor facing forward-looking customers who anticipate future sales and choose purchasing timing to maximize their expected surplus. We propose the equations satisfied by the RE equilibrium price and quantity for the risk-averse retailer in general setting and the explicit equilibrium decisions for the case where demand follows the uniform distribution and utility is a general power function. We identify the impacts of the system parameters on the RE equilibrium for this specific situation. In particular, we show that the RE equilibrium price for some risk-averse newsvendors is lower than for a risk-neutral retailer and the RE equilibrium stocking quantity for some risk-averse newsvendors is higher than for a risk-neutral retailer. We also find that the RE equilibrium sale price for a risk-averse newsvendor is decreasing in salvage price in some situations.

Owing to the complexity of the wafer fabrication, the due date assignment of each job presents a challenging problem to the production planning and scheduling people. To tackle this problem, an effective fuzzy-neural approach is proposed in this study to improve the performance of internal due date assignment in a wafer fabrication factory. Some innovative treatments are taken in the proposed methodology. First, principal component analysis (PCA) is applied to construct a series of linear combinations of the original variables to form a new variable, so that these new variables are unrelated to each other as much as possible, and the relationship among them can be reflected in a better way. In addition, the simultaneous application of PCA, fuzzy c-means (FCM), and back propagation network (BPN) further improved the estimation accuracy. Subsequently, the iterative upper bound reduction (IUBR) approach is proposed to determine the allowance that will be added to the estimated job cycle time. An applied case that uses data collected from a wafer fabrication factory illustrates this effective fuzzy-neural approach.

After investigating the advantages and disadvantages of current methods of statistical process control, it becomes important to overcome the disadvantages and then use the advantages to improve a method for monitoring a process with categorical observations. An approach which considers uncertainty and vagueness is tried for this study; and for this purpose, fuzzy set theory is inevitable to use. So, a new approach based on fuzzy set theory is introduced in this research for monitoring attribute quality characteristics. This approach is then compared with the current related approach to see the difference in performance.

It is well known that data envelopment analysis (DEA) models are sensitive to selection of input and output variables. As the number of variables increases, the ability to discriminate between the decision making units (DMUs) decreases. Thus, to preserve the discriminatory power of a DEA model, the number of inputs and outputs should be kept at a reasonable level. There are many cases in which an interval scale output in the sample is derived from the subtraction of nonnegative linear combination of ratio scale outputs and nonnegative linear combination of ratio scale inputs. There are also cases in which an interval scale input is derived from the subtraction of nonnegative linear combination of ratio scale inputs and nonnegative linear combination of ratio scale outputs. Lee and Choi (2010) called such interval scale output and input a cross redundancy. They proved that the addition or deletion of a cross-redundant output variable does not affect the efficiency estimates yielded by the CCR or BCC models. In this paper, we present an extension of cross redundancy of interval scale outputs and inputs in DEA models. We prove that the addition or deletion of a cross-redundant output and input variable does not affect the efficiency estimates yielded by the CCR or BCC models.

We discuss structural models based on Merton's framework. First, we observe that the classical assumptions of the Merton model are generally rejected. Secondly, we implement a structural credit risk model based on stable non-Gaussian processes as a representative of subordinated models in order to overcome some drawbacks of the Merton one. Finally, following the KMV-Merton estimation methodology, we propose an empirical comparison between the results obtained from the classical KMV-Merton model and the stable Paretian one. In particular, we suggest alternative parameter estimation for subordinated processes, and we optimize the performance for the stable Paretian model.

The policy of jointly implementing signal control and congestion pricing in the transportation network is investigated. Bilevel programs are developed to model the simultaneous optimization of signal setting and congestion toll. The upper level aims to maximize the network reserve capacity or minimize the total travel time, subject to signal setting and toll constraints. The lower level is a deterministic user equilibrium problem given a plan of signal setting and congestion charge. Then the bilevel programs are transferred into the equivalent single level programs, and the solution methods are discussed. Finally, a numerical example is presented to illustrate the concepts and methods, and it is shown that the joint implementation policy can achieve promising results.

In the course of improving various abilities of data envelopment analysis (DEA) models, many investigations have been carried out for ranking decision-making units (DMUs). This is an important issue both in theory and practice. There exist a variety of papers which apply different ranking methods to a real data set. Here the ranking methods are divided into seven groups. As each of the existing methods can be viewed from different aspects, it is possible that somewhat these groups have an overlapping with the others. The first group conducts the evaluation by a cross-efficiency matrix where the units are self- and peer-evaluated. In the second one, the ranking units are based on the optimal weights obtained from multiplier model of DEA technique. In the third group, super-efficiency methods are dealt with which are based on the idea of excluding the unit under evaluation and analyzing the changes of frontier. The fourth group involves methods based on benchmarking, which adopts the idea of being a useful target for the inefficient units. The fourth group uses the multivariate statistical techniques, usually applied after conducting the DEA classification. The fifth research area ranks inefficient units through proportional measures of inefficiency. The sixth approach involves multiple-criteria decision methodologies with the DEA technique. In the last group, some different methods of ranking units are mentioned.

Consider a large mixed integer linear problem where structure of the constraint matrix is sparse, with independent blocks, and coupling constraints and variables. There is one of the groups of constraints to make difficult the application of Benders scheme decomposition. In this work, we propose the following algorithm; a Lagrangian relaxation is made on the mentioned set of constraints; we presented a process heuristic for the calculation of the multiplier through the resolution of the dual problem, structured starting from the bundle methods. According to the methodology proposed, for each iteration of the algorithm, we propose Benders decomposition where quotas are provided for the value function and $\epsilon$-subgradient.

Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplex method. But their computational complexities are exponential, which is not satisfactory for solving large-scale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programming problems is presented in this paper, which is named a revised interior point method. Its idea is similar to that of interior point method used for solving linear programming problems in crisp environment before, but its feasible direction and step size are chosen by using trapezoidal fuzzy numbers, linear ranking function, fuzzy vector, and their operations, and its end condition is involved in linear ranking function. Their correctness and rationality are proved. Moreover, choice of the initial interior point and some factors influencing the results of this method are also discussed and analyzed. The result of algorithm analysis and example study that shows proper safety factor parameter, accuracy parameter, and initial interior point of this method may reduce iterations and they can be selected easily according to the actual needs. Finally, the method proposed in this paper is an alternative method for solving fuzzy number linear programming problems.

Process control tools are a widely used approach in many operations and production processes. Process control chart ranks as one of the most important theories used in these disciplines. This paper reviewed the bias of quality characteristics monitoring. Specifically, this study tries to provide a comprehensive understanding of theories of process control. The text starts with a theoretical review of statistical process control theories and follows by a technical introduction to developed tools for process control.

We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.

Deterministic inventory model, the economic order quantity (EOQ), reveals that carrying inventory or ordering frequency follows a relation of tradeoff. For probabilistic demand, the tradeoff surface among annual order, expected inventory and shortage are useful because they quantify what the firm must pay in terms of ordering workload and inventory investment to meet the customer service desired. Based on a triobjective inventory model, this paper employs the successive approximation to obtain efficient control policies outlining tradeoffs among conflicting objectives. The nondominated solutions obtained by successive approximation are further used to plot a 3D scatterplot for exploring the relationships between objectives. Visualization of the tradeoffs displayed by the scatterplots justifies the computation effort done in the experiment, although several iterations needed to reach a nondominated solution make the solution procedure lengthy and tedious. Information elicited from the inverse relationships may help managers make deliberate inventory decisions. For the future work, developing an efficient and effective solution procedure for tradeoff analysis in multiobjective inventory management seems imperative.

A new entropy measure of interval-valued intuitionistic fuzzy set (IVIFS) is proposed by using cotangent function, which overcomes several limitations in the existing methods for calculating entropy of IVIFS. The efficiency of the new entropy is demonstrated by comparing it with several classical entropies. Moreover, an entropy weight model is established to determine the entropy weights for fuzzy multicriteria group decision-making (FMCGDMs) problems, which depends on incomplete weight information of criteria in IVIFSs setting. Finally, an illustrative supplier selection problem is used to demonstrate the practicality and effectiveness of the proposed method. It is capable of the handling the FMCGDM problems with incomplete known weights for criteria.

Expected residual minimization (ERM) model which minimizes an expected residual function defined by an NCP function has been studied in the literature for solving stochastic complementarity problems. In this paper, we first give the definitions of stochastic $P$-function, stochastic $P_0$-function, and stochastic uniformly $P$-function. Furthermore, the conditions such that the function is a stochastic $P\left(P_0\right)$-function are considered. We then study the boundedness of solution set and global error bounds of the expected residual functions defined by the “Fischer-Burmeister” (FB) function and “min” function. The conclusion indicates that solutions of the ERM model are robust in the sense that they may have a minimum sensitivity with respect to random parameter variations in stochastic complementarity problems. On the other hand, we employ quasi-Monte Carlo methods and derivative-free methods to solve ERM model.

This paper proposes a model for estimating car delays at bus stops under mixed traffic using probability theory and queuing theory. The roadway is divided to serve motorized and nonmotorized traffic streams. Bus stops are located on the nonmotorized lanes. When buses dwell at the stop, they block the bicycles. Thus, two conflict points between car stream and other traffic stream are identified. The first conflict point occurs as bicycles merge to the motorized lane to avoid waiting behind the stopping buses. The second occurs as buses merge back to the motorized lane. The average car delay is estimated as the sum of the average delay at these two conflict points and the delay resulting from following the slower bicycles that merged into the motorized lane. Data are collected to calibrate and validate the developed model from one site in Beijing. The sensitivity of car delay to various operation conditions is examined. The results show that both bus stream and bicycle stream have significant effects on car delay. At bus volumes above 200 vehicles per hour, the curbside stop design is not appropriate because of the long car delays. It can be replaced by the bus bay design.

Previous studies of road congestion pricing problem assume that transportation networks are managed by a central administrative authority with an objective of improving the performance of the whole network. In practice, a transportation network may be comprised of multiple independent local regions with relative independent objectives. In this paper, we investigate the cooperative and competitive behaviors among multiple regions in congestion pricing considering stochastic conditions; especially demand uncertainty is taken into account in transportation modelling. The corresponding congestion pricing models are formulated as a bilevel programming problem. In the upper level, congestion pricing model either aims to maximize the regional social welfare in competitive schemes or attempts to maximize the total social welfare of multiple regions in cooperative schemes. In the lower level, travellers are assumed to follow a reliability-based stochastic user equilibrium principle considering risks of late arrival under uncertain conditions. Numerical examples are carried out to compare the effects of different pricing schemes and to analyze the impact of travel time reliability. It is found that cooperative pricing strategy performs better than competitive strategy in improving network performance, and the pricing effects of both schemes are quite sensitive to travel time reliability.

A new nonmonotone filter trust region method is introduced for solving optimization problems with equality constraints. This method directly uses the dominated area of the filter as an acceptability criterion for trial points and allows the dominated area decreasing nonmonotonically. Compared with the filter-type method, our method has more flexible criteria and can avoid Maratos effect in a certain degree. Under reasonable assumptions, we prove that the given algorithm is globally convergent to a first order stationary point for all possible choices of the starting point. Numerical tests are presented to show the effectiveness of the proposed algorithm.

Data envelopment analysis (DEA) models can calculate the Malmquist Productivity Index (MPI). Classic Malmquist Productivity Index shows regress and progress of a DMU in different periods with efficiency and technology variations without considering the present value of money. This issue is of major importance since while a currency of in previous year is not equal to that of now this would yield bias results which can affect the correct interpretation. The index developed here is defined in terms of Modified Malmquist Productivity Index model, which can calculate progress and regress by using the factor of present time value of money. The incorporation of present time value of money is also calculated within the framework of data envelopment analysis. This factor is fundamental and should be considered in DEA Malmquist Productivity Index. Moreover, here, differences between presented models are compared to those of previous ones indeed, biased results will be shown in the case study in banks, and problem and solution have been investigated in the literature.

A new bandwidth allocation model is studied in this paper. In this model, a system, such as a communication network, is composed of a finite number of users, and they compete for limited bandwidth resources. Each user adopts the decision that maximizes his or her own benefit characterized by the utility function. The decision space of each user is subject to constraints. In addition, some users form a group, and their joint decision space is also subject to constraints. Under the assumption that each user’s utility function satisfies some continuity and concavity conditions, the existence, uniqueness, and fairness, in some appropriate sense, of the Nash equilibrium point in the allocation game are proved. An algorithm yielding a sequence converging to the equilibrium point is proposed. Finally, a numerical example with detailed analysis is provided to illustrate the effectiveness of our work.