ISSN 15475816(print)
ISSN 1553166X(online) 
Current volume

Journal archive


JIMO is covered in Science Citation Index Expanded, CompuMath Citation Index, Current Contents/Engineering, Computing and Technology ISI Alerting Services.
JIMO is an international journal devoted to publishing peerreviewed, high quality, original papers on the nontrivial interplay between numerical optimization methods and practically significant problems in industry or management so as to achieve superior design, planning and/or operation. Its objective is to promote collaboration between optimization specialists, industrial practitioners and management scientists so that important practical industrial and management problems can be addressed by the use of appropriate, recent advanced optimization techniques.
It is particularly hoped that the study of these practical problems will lead to the discovery of new ideas and the development of novel methodologies in optimization.
JIMO is published by AIMS and sponsored by the Department of Mathematics and Statistics, Curtin University and the Department of Mathematics, Zhejiang University.
Archived in Portico 
TOP 10 Most Read Articles in JIMO, January 2015
1 
Supply chain inventory management via a Stackelberg equilibrium
Volume 2, Number 1, Pages: 81  94, 2006
YeongCheng Liou,
Siegfried Schaible
and JenChih Yao
Abstract
Full Text
Related Articles
In this paper we consider onebuyer, oneseller, finite horizon,
multiperiod inventory models in which the economic order quantity
is integrated with the economic production quantity (EOQEPQ in
short). We introduce the Stackelberg equilibrium framework in
which the objective is to maximize the vendor's total benefit
subject to the minimum total cost that the buyer is willing to
incur. Some existence results, optimality conditions and the
optimal replenishment policy under the Stackelberg equilibrium
concept are obtained and a numerical algorithm and examples are
presented to find the optimal replenishment policy in practice.

2 
Cluster synchronization for linearly coupled complex
networks
Volume 7, Number 1, Pages: 87  101, 2011
Xiwei Liu,
Tianping Chen
and Wenlian Lu
Abstract
References
Full Text
Related Articles
In this paper, the cluster synchronization for an array of linearly
coupled identical chaotic systems is investigated. New coupling
schemes (or coupling matrices) are proposed, by which global cluster
synchronization of linearly coupled chaotic systems can be realized.
Here, the number and the size of clusters (or groups) can be
arbitrary. Some sufficient criteria to ensure global cluster
synchronization are derived. Moreover, for any given coupling
matrix, new coupled complex networks with adaptive coupling
strengths are proposed, which can synchronize coupled chaotic
systems by clusters. Numerical simulations are finally given to show
the validity of the theoretical results.

3 
A note on mixed type converse duality in multiobjective programming problems
Volume 6, Number 3, Pages: 497  500, 2010
Xinmin Yang
and Xiaoqi Yang
Abstract
Full Text
Related Articles
In this note, we establish a mixed type converse duality for a class
of multiobjective programming programs. This clarifies several
omissions in an earlier work
by Yang et al. [Mixed type converse duality in multiobjective programming problems,
J. Math. Anal. Appl. 304 (2005) 394398].

4 
A new exact penalty function method for continuous inequality
constrained optimization problems
Volume 6, Number 4, Pages: 895  910, 2010
Changjun Yu,
Kok Lay Teo,
Liansheng Zhang
and Yanqin Bai
Abstract
References
Full Text
Related Articles
In this paper, a computational approach based on a new exact penalty
function method is devised for solving a class of continuous
inequality constrained optimization problems. The continuous
inequality constraints are first approximated by smooth function in
integral form. Then, we construct a new exact penalty function,
where the summation of all these approximate smooth functions in
integral form, called the constraint violation, is appended to the
objective function. In this way, we obtain a sequence of approximate
unconstrained optimization problems. It is shown that if the value
of the penalty parameter is sufficiently large, then any local
minimizer of the corresponding unconstrained optimization problem is
a local minimizer of the original problem. For illustration, three
examples are solved using the proposed method. From the solutions
obtained, we observe that the values of their objective functions
are amongst the smallest when compared with those obtained by other
existing methods available in the literature. More importantly, our
method finds solution which satisfies the continuous inequality
constraints.

5 
A differential equation method for solving
box constrained variational inequality problems
Volume 7, Number 1, Pages: 183  198, 2011
Li Wang,
Yang Li
and Liwei Zhang
Abstract
References
Full Text
Related Articles
In this paper, we discuss a system of differential equations based
on the projection operator for solving the box constrained
variational inequality problems. The equilibrium solutions to the
differential equation system are proved to be the solutions of the
box constrained variational inequality problems. Two differential
inclusion problems associated with the system of differential
equations are introduced. It is proved that the equilibrium
solution to the differential equation system is locally
asymptotically stable by verifying the locally asymptotical
stability of the equilibrium positions of the differential
inclusion problems. An Euler discrete scheme with Armijo line
search rule is introduced and its global convergence is
demonstrated. The numerical experiments are reported to show that
the Euler method is effective.

6 
A power penalty approach to american option pricing with jump diffusion processes
Volume 4, Number 4, Pages: 783  799, 2008
Kai Zhang,
Xiaoqi Yang
and Kok Lay Teo
Abstract
Full Text
Related Articles
This paper is devoted to develop a power penalty method for pricing
the American option model where the underlying asset is assumed to
follow a jump diffusion process. With the help of the linear
complementarity problem and variational inequalities, we propose a
power penalty approach for a partial integrodifferential
complementarity problem, which is the mathematical model of pricing
the American option with a jump diffusion process. The convergence
analysis of the power penalty approach is established. Finally,
based on the finite element discretization, a numerical scheme is
developed to solve the penalized problem and the numerical tests are
designed to illustrate the efficiency of this method.

7 
Time delayed optimal control problems with multiple characteristic time points:
Computation and industrial applications
Volume 5, Number 4, Pages: 705  718, 2009
Ling Yun Wang,
Wei Hua Gui,
Kok Lay Teo,
Ryan Loxton
and Chun Hua Yang
Abstract
Full Text
Related Articles
In this paper, we consider a class of optimal control problems
involving time delayed dynamical systems and subject to continuous
state inequality constraints. We show that this type of problem can
be approximated by a sequence of time delayed optimal control
problems subject to inequality constraints in canonical form and
with multiple characteristic time points appearing in the cost and
constraint functions. We derive formulae for the gradient of the
cost and constraint functions of the approximate problems. On this
basis, each approximate problem can be solved using a gradientbased
optimization technique. The computational method obtained is then
applied to an industrial problem arising in the study of
purification process of zinc sulphate electrolyte. The results are
highly satisfactory.

8 
A queueing analysis of multipurpose production facility's operations
Volume 7, Number 1, Pages: 19  30, 2011
Lotfi Tadj,
Zhe George Zhang
and Chakib Tadj
Abstract
References
Full Text
Related Articles
In this paper, we study the production time allocation issue for a multipurpose manufacturing facility. This production facility can produce different types of maketoorder and maketostock products. Using a vacation queueing model, we develop a set of quantitative performance measures for a twoparameter time allocation policy. Based on the renewal cycle analysis, we derive an average cost expression and propose a search algorithm to find the optimal time allocation policy that minimizes the average cost. Some numerical examples are presented to demonstrate the effectiveness of the search algorithm. The vacation model used in this paper is also a generalization of some previous vacation queueing models in the literature. The results obtained in this study are useful for production managers to design the operating policy in practice.

9 
Censored newsvendor model revisited with unnormalized probabilities
Volume 5, Number 2, Pages: 391  402, 2009
Alain Bensoussan,
Metin Çakanyildirim
and Suresh P. Sethi
Abstract
Full Text
Related Articles
This paper revisits the model of the censored newsvendor presented by Ding, Puterman and Bisi [8], We analyze that model in an infinitehorizon context by using the interesting concept of unnormalized probabilities. The unnormalized probabilities considerably simplify the dynamic programming equation and facilitate the proof of the existence of an optimal policy. They can also be used to give a simple, alternative proof to Ding et al.'s claim that the myopic order quantity is always less than or equal to the optimal order quantity. Importantly, the concept of unnormalized probabilities can be used to treat other important operations research problems with partial observations.

10 
Optimal control of
piecewise affine systems with piecewise affine state feedback
Volume 5, Number 4, Pages: 737  747, 2009
Changzhi Wu,
Kok Lay Teo
and Volker Rehbock
Abstract
Full Text
Related Articles
In this paper, we consider a class of optimal control problems involving
piecewise affine (PWA) systems with piecewise affine state feedback. We
first show that if the piecewise affine state feedback control is assumed to
be continuous at the switching boundaries, then the number of switching
amongst PWA systems is finite. On this basis, this optimal control problem
is transformed into a discrete valued optimal control problem. For this
discrete valued optimal control problem, we introduce the time scaling
transform to convert it into an equivalent constrained optimal parameter
selection problem, for which it can be solved by existing optimal control
techniques for optimal parameter selection problems. A numerical example is
solved so as to illustrate the proposed method.

Go to top

