Journal of Industrial and Management Optimization
January 2010 , Volume 6 , Issue 1
Select all articles
In the Bahncard problem a traveler decides when to buy a Bahncard, i.e., a railway discount card of the German Deutsche Bundesbahn company, in an online setting. This problem is introduced by Fleischer and some optimal deterministic algorithms are presented with a fixed Bahncard price. In practice, however, travelers are trying to manage their risks by using some forms of rewards and their forecasting skills. We extend Fleischer's model to a new one in a risk management framework. For such an extended problem, we provide some flexible results which can be used by a traveler to obtain an optimal risk algorithm based on his risk tolerance and forecast. We further study another extention of the Bahncard problem with a fluctuated Bahncard price. We propose some algorithms and analyze their competitive ratios with and without risk, respectively. It turns out that a traveler can significantly improve his risk management performance by putting reasonable forecasts in conventional competitive analysis.
An infinite-dimensional linear programming formulated on $L_1$ spaces, problem (P), is studied in this paper. A related optimization problem, general capacity problem (GCAP), is also mentioned in this paper. But we find that the optimal solution does not exist in problem (P). Thus, we approach the optimal value for problem (P) via solving the problem (GCAP). A proposed algorithm is shown that we solve a sequence of semi-infinite subproblems to approach the optimal value of problem (P). The error bound for the difference between the optimal value for problem (P) and optimal value for semi-infinite subproblem is also given in this paper. Finally, numerical examples are implemented and compared with discretization method to show our computational efficiency.
The problem of the determination of the minimum energy configuration of an arrangement of $N$ point particles under the interaction of their interatomic forces is discussed. The interatomic force is described by a classical many body potential, namely the Tersoff potential for silicon. We propose a global optimization algorithm for minimization of energy of clusters of particles using Tersoff potential. The algorithm combines the topographical differential evolution (TDE) with the modified recursive procedure of the recursive differential evolution (RDE) algorithm. It also introduces an initialization procedure for the population set. Two important features of the new algorithm are that it makes use of the \lq graph minima' for local search, and that the initial population set is generated with low function values. The global minima of clusters consisting of up to 20 particles are investigated. The new algorithm is compared with a recent genetic algorithm.
In this paper we consider smooth and nonsmooth switching control problems. By applying Taylor incremental formula for the cost functional, first we obtain the necessary optimality condition for the smooth case. Then by applying the Freschet superdifferential and uniform upper subdifferentiability, we extend necessary condition to the nonsmooth switching control problems.
This work constructs the membership functions of the system characteristics of a heterogeneous-server queueing model with fuzzy customer arrival and service rates. The $\alpha$-cut approach is used to transform a fuzzy queue into a family of conventional crisp queues in this context. By means of the membership functions of the system characteristics, a set of parametric nonlinear programs is developed to describe the family of crisp heterogeneous-server queues. A numerical example is solved successfully to illustrate the validity of the proposed approach. By extending this model to the fuzzy environment, the system characteristics are expressed and governed by the membership functions, and more information is provided for use by designers and practitioners.
The economic behavior of service providers in a competitive environment is a very important and interesting research topic. A two-server service network has been proposed by Kalai et al.  for this purpose. Their model actually aims at studying both the role and impact of service capacity in capturing larger market share. The market share is important in maximizing individual's long-run expected profit. A Markovian queueing system of two servers was employed in their model for the captured problem. The obvious advantage of such a model is that it is mathematically tractable. They then further formulated the problem as a two-person strategic game and analyzed the equilibrium solutions. The main aim of this paper is to extend the results of their two-server queueing model to the case of a general multiple-server queueing model. Here we will focus on the case when the queueing system is stable. It is found that when the marginal cost of service capacity is low relatively to the revenue per customer, a unique Nash equilibrium exists, in which all servers choose the same service capacity and the expected waiting times are finite.
Without the information of the origin-destination demand function and users' valuation for travel time saving, the precise estimation of the road tolls for various pricing schemes must go in a trial-and-error manner, as suggested by  and , and recently realized by [6, 7, 11, 22, 24]. For a trial of the tolls pattern, the responses of the users can be observed and used to update the toll pattern for the next trial. Since getting the responses of the users is expensive, it is desirable to use the acquired information exhaustively; That is, we need to make the method converge to an approximate solution of the problem within as little number of changes as possible.
In this paper, we propose to update the link tolls pattern in an improved manner, where the profit direction is the combination of two known directions. This combined manner makes the method more efficient than the method using solely one of them. We prove the global convergence of the method under suitable conditions as those in [6, 7, 24]. Some preliminary computational results are also reported.
In this paper, we present a multiperiod model for production planning in a make-to-stock manufacturing system with constant pricing. We consider a multiproduct capacitated setting and introduce a demand-based model where the demand is a function of the price. There is an assumption that the production setup costs are negligible. A key part of the model is that backorders are allowed. As a result of this, the problem becomes a non linear programming problem with the nonlinearities in both the objective function and some constraints. We develop an algorithm that computes the global optimal production and pricing policy on a finite time horizon. We illustrate the application of the algorithm through a detailed numerical example.
In this paper, a fully derivative-free method for solving large-scale nonlinear systems of equations is presented. It uses in a systematic way the well-known Polak-Ribière-Polyak (PRP) conjugate gradient direction as a search direction and employs a backtracking process to obtain a suitable stepsize. Assume that the nonlinear mapping is Lipschitz continuous, some global convergence results are established. A modification of this method which may allow the objective function's sufficiently nonmonotone behavior is also presented in this paper. Numerical comparisons using a set of large-scale test problems in the CUTE library show that the proposed methods are encouraging.
A number of numerical methods for solving optimal feedback control problems are based on the viscosity approximation to the Hamilton-Jacobi-Bellman (HJB) equation, with artificial boundary conditions defined on an extended domain. An upper bound for this extended domain is established, ensuring that the approximate solution converges to the viscosity solution of the HJB equation on some pre-defined domain of interest.
In this article, we propose a method for finding the global optimum of a class of nonlinear bilevel programming problems. The main idea of this method is to construct iteratively a sequence of points either ending at an optimal solution of the equivalent problem with a complementarity constraint, or converging to an optimal solution. The construction of such a sequence is performed by using a branch-and-bound scheme, together with some relaxation techniques, which are successfully applied in global optimization. Some illustrative examples and results on computational experiments are reported.
This paper investigates the M/M/R machine repair problem with second optional repair. Failure times of the operating machines are assumed to be exponentially distributed with parameter $\lambda $. Repair times of the first essential repair and the second optional repair are assumed to follow exponential distributions. A failed machine may leave the system either after the first essential repair with probability $(1-\theta)$, or select to repair for second optional repair with probability $\theta$ $(0 \le \theta \le 1)$ at the completion of the first essential repair. We obtain the steady-state solutions through matrix-analytic method. A cost model is derived to determine the optimal number of the repairmen, the optimal values of the first essential repair rate, and the second optional repair rate while maintaining the system availability at a specified level. We use the direct search method to deal with the number of repairmen problem and the Newton-Quasi method for the repair rate problem to minimize the system operating cost while all the constraints are satisfied.
This paper studies the capacity planning and expansion for the thin film transistor - liquid crystal display (TFT-LCD) manufacturing. Capacity planning is critical to TFT-LCD industry due to its complex product hierarchy and increasing product types; the coexistence of multiple generations of manufacturing technologies in a multi-site production environment; and the rapidly growing market demands. One key purpose of capacity planning is to simultaneously determine the profitable "product mix" and "production quantities" of each product group across various generation sites in a particular period and the optimal "capacity expansion quantity" of specific product groups at a certain site to improve the limited flexibility configurations through the acquisition of new auxiliary tools. This paper proposes a mixed integer linear programming model for capacity planning that incorporates practical characteristics and constraints in TFT-LCD manufacturing. A shadow-price based heuristic is developed to find a near-optimal solution. Preliminary computational study shows that the proposed heuristic provides good quality solutions in a reasonable amount of time. The proposed heuristic outperforms the traditional branch and bound method as the data size becomes large.
We consider a class of stochastic nonlinear complementarity problems. We first formulate the stochastic complementarity problem as a stochastic programming model. Based on this reformulation, we propose a penalty-based sample average approximation (in short, SAA) method for stochastic complementarity problem and prove its convergence. Finally, we report some numerical test results to show the efficiency of our method.
In this paper, we consider the generalized linear complementarity problem over a polyhedral cone arising in economics and engineering. For this problem, we first discuss its solution existence and then propose a potential reduction algorithm to solve it. The sparseness of the involved coefficient matrix is fully exploited in the computation of the algorithm and hence it has a relatively lower computational cost. The global convergence of the method is obtained under milder conditions. The given preliminary numerical experiments show the efficiency of the method.
Add your name and e-mail address to receive news of forthcoming issues of this journal:
[Back to Top]