All Issues

Volume 18, 2022

Volume 17, 2021

Volume 16, 2020

Volume 15, 2019

Volume 14, 2018

Volume 13, 2017

Volume 12, 2016

Volume 11, 2015

Volume 10, 2014

Volume 9, 2013

Volume 8, 2012

Volume 7, 2011

Volume 6, 2010

Volume 5, 2009

Volume 4, 2008

Volume 3, 2007

Volume 2, 2006

Volume 1, 2005

Journal of Industrial and Management Optimization

April 2019 , Volume 15 , Issue 2

Select all articles


A potential reduction method for tensor complementarity problems
Kaili Zhang, Haibin Chen and Pengfei Zhao
2019, 15(2): 429-443 doi: 10.3934/jimo.2018049 +[Abstract](5850) +[HTML](1576) +[PDF](436.24KB)

As an extension of linear complementary problem, tensor complementary problem has been effectively applied in \begin{document}$ n $\end{document}-person noncooperative game. And a multitude of researchers have focused on its properties and theories, while the valid algorithms for tensor complementary problem is still deficient. In this paper, stimulated by the potential reduction method for linear complementarity problem, we present a new algorithm for the tensor complementarity problem, which combines the idea of damped Newton method and the interior point method. Utilizing the new algorithm, we settle the tensor complementary problem with the underlying tensor being diagonalizable and positive definite. Furthermore, the global convergence of the iterative scheme is theoretically guaranteed and the given preliminary numerical experiments indicate the efficiency of the method.

Dynamic optimal decision making for manufacturers with limited attention based on sparse dynamic programming
Haiying Liu, Wenjie Bi, Kok Lay Teo and Naxing Liu
2019, 15(2): 445-464 doi: 10.3934/jimo.2018050 +[Abstract](5420) +[HTML](1560) +[PDF](419.61KB)

In a fully competitive industry, the market demand is changing rapidly. Thus, it is important for manufacturers to manage their inventory effectively as well as to determine the best order quantity and optimal production strategy. In this paper, our concern is how shall a manufacturer with limited attention determine his optimal order quantity and optimal production strategy in an environment when many factors are volatile, such as the price of raw materials (respectively, finished goods) and attrition rate of inventory of raw materials (respectively, finished product). Under this environment, it is observed, according to various empirical studies, that decision makers tend to focus their attention on factors with major changes. Taking all these into account, our problem is formulated as a discrete-time stochastic dynamic programming. We propose a general approach based on the sparse dynamic programming method to solve this multidimensional dynamic programming problem. From the numerical examples solved using the proposed method, it is interesting to observe that decision makers with limited attention do not adjust their final decision when the volatility is small.

Higher-order weak radial epiderivatives and non-convex set-valued optimization problems
Qilin Wang, Liu He and Shengjie Li
2019, 15(2): 465-480 doi: 10.3934/jimo.2018051 +[Abstract](4605) +[HTML](1413) +[PDF](424.67KB)

In the paper, we propose the notion of the higher-order weak radial epiderivative of a set-valued map, and discuss some of its properties. Then, by virtue of the higher-order weak radial epiderivative, we establish the optimality necessary conditions and sufficient ones of weak efficient solutions (Pareto efficient solutions) for non-convex set-valued optimization problems. Some of the obtained results improve and extend the recent existing results. Several examples are provided to show the main results obtained.

Asymptotics for a bidimensional risk model with two geometric Lévy price processes
Yang Yang, Kaiyong Wang, Jiajun Liu and Zhimin Zhang
2019, 15(2): 481-505 doi: 10.3934/jimo.2018053 +[Abstract](4745) +[HTML](1207) +[PDF](463.28KB)

Consider a bidimensional risk model with two geometric Lévy price processes and dependent heavy-tailed claims, in which we allow arbitrary dependence structures between the two claim-number processes generated by two kinds of businesses, and between the two geometric Lévy price processes. Under the assumption that the claims have consistently varying tails, the asymptotics for the infinite-time and finite-time ruin probabilities are derived.

Exclusion sets in the Δ-type eigenvalue inclusion set for tensors
Yaotang Li and Suhua Li
2019, 15(2): 507-516 doi: 10.3934/jimo.2018054 +[Abstract](3822) +[HTML](1204) +[PDF](375.66KB)

By excluding some sets which don't include any eigenvalue of a given tensor from the Δ-type eigenvalue inclusion set, two new Δ-type eigenvalue inclusion sets of tensors are given. And two criteria for identifying nonsingular tensors are also provided by using the new Δ-type eigenvalue inclusion sets.

Optimal threshold strategies with capital injections in a spectrally negative Lévy risk model
Manman Li and George Yin
2019, 15(2): 517-535 doi: 10.3934/jimo.2018055 +[Abstract](4591) +[HTML](1242) +[PDF](666.24KB)

This paper focuses on optimal threshold strategies for a spectrally negative Lévy (SNL) risk process with capital injections and proportional transaction costs. Restricted to solvency constraint, our model requires the shareholders of dividends prevent ruin by injecting capitals. Value function of the firm is assumed to be an expected discounted total [dividends less discounted capital injection]. Under such a setup, we derive certain key identities in connection with value function of the firm of a maximum dividend rate. Under restricted dividend rates and capital injection, we give analytical description of the maximum value function of the firm and the optimal threshold strategy explicitly.

RETRACTION: Peng Zhang, Chance-constrained multiperiod mean absolute deviation uncertain portfolio selection
Editorial Office
2019, 15(2): 537-564 doi: 10.3934/jimo.2018056 +[Abstract](5475) +[HTML](1942) +[PDF](71.9KB)

Journal of Industrial & Management Optimization, 15 (2019), 537–564

This paper is retracted by decision of the Editors in Chief of Journal of Industrial & Management Optimization.

An adaptive probabilistic algorithm for online k-center clustering
Ruiqi Yang, Dachuan Xu, Yicheng Xu and Dongmei Zhang
2019, 15(2): 565-576 doi: 10.3934/jimo.2018057 +[Abstract](4694) +[HTML](1135) +[PDF](416.53KB)

The \begin{document}$k$\end{document}-center clustering is one of the well-studied clustering problems in computer science. We are given a set of data points \begin{document}$P\subseteq R^d$\end{document}, where \begin{document}$R^d$\end{document} is \begin{document}$d$\end{document} dimensional Euclidean space. We need to select \begin{document}$k≤ |P|$\end{document} points as centers and partition the set \begin{document}$P$\end{document} into \begin{document}$k$\end{document} clusters with each point connecting to its nearest center. The goal is to minimize the maximum radius. We consider the so-called online \begin{document}$k$\end{document}-center clustering model where the data points in \begin{document}$R^d$\end{document} arrive over time. We present the bi-criteria \begin{document}$(\frac{n}{k}, (\log\frac{U^*}{L^*})^2)$\end{document}-competitive algorithm and \begin{document}$(\frac{n}{k}, \logγ\log\frac{nγ}{k})$\end{document}-competitive algorithm for semi-online and fully-online \begin{document}$k$\end{document}-center clustering respectively, where \begin{document}$U^*$\end{document} is the maximum cluster radius of optimal solution, \begin{document}$L^*$\end{document} is the minimum distance of two distinct points of \begin{document}$P$\end{document}, \begin{document}$γ$\end{document} is the ratio of the maximum distance of two distinct points and the minimum distance of two distinct points of \begin{document}$P$\end{document} and \begin{document}$n$\end{document} is the number of points that will arrive in total.

An uncertain programming model for single machine scheduling problem with batch delivery
Jiayu Shen and Yuanguo Zhu
2019, 15(2): 577-593 doi: 10.3934/jimo.2018058 +[Abstract](5423) +[HTML](1511) +[PDF](246.62KB)

A single machine scheduling problem with batch delivery is studied in this paper. The objective is to minimize the total cost which comprises earliness penalties, tardiness penalties, holding and transportation costs. An integer programming model is proposed and two dominance properties are obtained. However, sometimes due to the lack of historical data, the worker evaluates the processing time of a job according to his past experience. A pessimistic value model of the single machine scheduling problem with batch delivery under an uncertain environment is presented. Since the objective function is non-monotonic with respect to uncertain variables, a hybrid algorithm based on uncertain simulation and a g#enetic algorithm (GA) is designed to solve the model. In addition, two dominance properties under the uncertain environment are also obtained. Finally, computational experiments are presented to illustrate the modeling idea and the effectiveness of the algorithm.

Anode effect prediction based on collaborative two-dimensional forecast model in aluminum electrolysis production
Zuguo Chen, Yonggang Li, Xiaofang Chen, Chunhua Yang and Weihua Gui
2019, 15(2): 595-618 doi: 10.3934/jimo.2018060 +[Abstract](5805) +[HTML](2128) +[PDF](16325.84KB)

In this study, a new prediction algorithm is proposed, based on the collaborative two-dimensional forecast model (CTFM) that combines the traditional method and similarity search technique. The main idea of the algorithm is that the prediction of the change trend of the slope and the accumulated slope of the cell resistance as well as the useful knowledge obtained using the similarity search technique are used as the main criteria to calculate anode effect (AE)-prediction reliability. The accumulated mass deviation value is used as an auxiliary criterion to adjust the AE-prediction reliability. Finally, the current AE-process is marked according to the current AE-prediction reliability. The prediction model based on CTFM is tested on a real situation, in which multiple samples are extracted from the production of a 400 kA aluminum electrolysis cell. We observe that when the time advance of AE-prediction is within 20 ~ 40 min, the accuracy rate of the CTFM algorithm is greater than 95% and the applicability of the method is excellent, showing a high prediction accuracy for different aluminum electrolysis cells.

Optimum management of the network of city bus routes based on a stochastic dynamic model
Shi'an Wang and N. U. Ahmed
2019, 15(2): 619-631 doi: 10.3934/jimo.2018061 +[Abstract](4720) +[HTML](1227) +[PDF](1495.28KB)

In this paper, we develop a stochastic dynamic model for the network of city bus routes subject to resource and other practical constraints. We define an objective function on the basis of four terms: fuel cost, operating cost, customers waiting time, and revenue of the bus company. Hereafter, an optimization problem is formulated and solved by use of nonlinear integer programming. If the technique presented here is implemented, it is expected to boost the bus company's revenue, reduce waiting time and therefore promote customer satisfaction. A series of numerical experiments is carried out and the corresponding optimization problems are addressed giving the optimal number of buses allocated to each of the bus routes in the network. Since the dynamic model proposed here can be applied to any network of bus routes, it is believed that the procedure developed in this paper is of great potential for both the city bus company and the customers.

Immediate schedule adjustment and semidefinite relaxation
Jinling Zhao, Wei Chen and Su Zhang
2019, 15(2): 633-645 doi: 10.3934/jimo.2018062 +[Abstract](4247) +[HTML](1313) +[PDF](530.15KB)

This paper considers the problem of temporary shortage of some resources within a project execution period. Mathematical models for two different cases of this problem are established. Semidefinite relaxation technique is applied to get immediate solvent of these models. Relationship between the models and their semidefinite relaxations is studied, and some numerical experiments are implemented, which show that these mathematical models are reasonable and feasible for practice, and semidefinite relaxation can efficiently solve the problem.

Sufficiency and duality in non-smooth interval valued programming problems
Deepak Singh, Bilal Ahmad Dar and Do Sang Kim
2019, 15(2): 647-665 doi: 10.3934/jimo.2018063 +[Abstract](3783) +[HTML](1058) +[PDF](655.66KB)

In this paper a non-smooth optimization problem is studied in an uncertain environment. The objective function of this problem is interval valued function. We introduce the class of \begin{document}$LU-(p,r)-[ρ^L,ρ^U]-(η, θ)$\end{document}-invex interval valued functions about the Clarke generalized gradient. Then, through non trivial examples, we illustrate that the class of functions introduced exists. Based upon the proposed invexity assumptions, the sufficient optimality conditions are established. Further, we derive weak, strong and strict converse duality theorems for Mond-Weir type and Wolfe type dual programs. Some examples are also given in order to illustrate our results.

A joint dynamic pricing and production model with asymmetric reference price effect
Shichen Zhang, Jianxiong Zhang, Jiang Shen and Wansheng Tang
2019, 15(2): 667-688 doi: 10.3934/jimo.2018064 +[Abstract](5189) +[HTML](1985) +[PDF](772.49KB)

Reference price plays a significant role in influencing purchase decisions of customers. Due to loss aversion, the asymmetric reference price effect on market demand should be taken into account. This paper develops a joint dynamic pricing and production model with asymmetric reference price effect. In a finite planning horizon, the demand rate is time-varying and depends on price as well as reference price. The decision-making problem with the asymmetric reference price effect turns to be a nonsmooth optimal control problem, which cannot be solved by standard optimal control method. As a special case, we first obtain the joint optimal dynamic pricing and production strategy with symmetric reference price effect by solving the corresponding standard optimal control problem based on Maximum principle. For the case of asymmetric reference price effect, we propose a systematical method on basis of optimality principle to solve the nonsmooth optimal control problem, and obtain the joint strategy. Numerical examples are employed to illustrate the effectiveness of the proposed method. In addition, we assess the sensitivity analysis of system parameters to examine the impacts of asymmetric reference price on optimal pricing and production strategies and total profits.

Optimal information policy in discrete-time queues with strategic customers
Veena Goswami and Gopinath Panda
2019, 15(2): 689-703 doi: 10.3934/jimo.2018065 +[Abstract](4085) +[HTML](1536) +[PDF](434.62KB)

This paper studies optimal information revelation policies in discrete-time \begin{document}$Geo/Geo/1$\end{document} queue. Revealing the queue length information to arriving customers plays an important role in their decision making, that is, whether to join the system or balk. We consider policies where a service provider discloses information to some customers and conceals it from others, depending upon the number of waiting customers. This partial information disclosure policy helps the service provider minimize the idle period of the system and maximize the revenue.

Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations
Hong-Zhi Wei and Chun-Rong Chen
2019, 15(2): 705-721 doi: 10.3934/jimo.2018066 +[Abstract](4017) +[HTML](1225) +[PDF](904.15KB)

In this paper, we propose three concepts of robust efficiency for uncertain multiobjective optimization problems by replacing set order relations with the minmax less order relation, the minmax certainly less order relation and the minmax certainly nondominated order relation, respectively. We make interpretations for these concepts and analyze the relations between new concepts and the existent concepts of efficiency. Some examples are given to illustrate main concepts and results.

A proximal alternating direction method for multi-block coupled convex optimization
Foxiang Liu, Lingling Xu, Yuehong Sun and Deren Han
2019, 15(2): 723-737 doi: 10.3934/jimo.2018067 +[Abstract](5002) +[HTML](1787) +[PDF](863.92KB)

In this paper, we propose a proximal alternating direction method (PADM) for solving the convex optimization problems with linear constraints whose objective function is the sum of multi-block separable functions and a coupled quadratic function. The algorithm generates the iterate via a simple correction step, where the descent direction is based on the PADM. We prove the convergence of the generated sequence under some mild assumptions. Finally, some familiar numerical results are reported for the new algorithm.

Selection of DRX scheme for voice traffic in LTE-A networks: Markov modeling and performance analysis
Anupam Gautam and Selvamuthu Dharmaraja
2019, 15(2): 739-756 doi: 10.3934/jimo.2018068 +[Abstract](4618) +[HTML](1590) +[PDF](227.53KB)

Power saving is a leading issue in the User Equipment (UE) for limited source of power in Long Term Evolution-Advanced (LTE-A) networks. Battery power of an UE gets exhaust quickly due to the heavy use of many service applications and large data transmission. Discontinuous reception (DRX) is a mechanism used for power saving in UE in the LTE-A networks. There are scope of improvements in conventional DRX scheme in LTE-A networks for voice communication. In this paper, a DRX scheme is chosen by selecting optimal parameters of DRX scheme, while keeping Quality of Service (QoS) delay requirements. Further, delay analysis for first downlink packet is performed. Moreover, expressions for delay distribution and expected delay of any downlink packet, are obtained and represented graphically. Based on analytical model, the trade-off relationship between the power saving and queueing delay is investigated.

A proximal-projection partial bundle method for convex constrained minimax problems
Chunming Tang, Jinbao Jian and Guoyin Li
2019, 15(2): 757-774 doi: 10.3934/jimo.2018069 +[Abstract](4790) +[HTML](1125) +[PDF](531.53KB)

In this paper, we propose a partial bundle method for a convex constrained minimax problem where the objective function is expressed as maximum of finitely many convex (not necessarily differentiable) functions. To avoid complete evaluation of all component functions of the objective, a partial cutting-planes model is adopted instead of the traditional one. Based on the proximal-projection idea, at each iteration, an unconstrained proximal subproblem is solved first to generate an aggregate linear model of the objective function, and then another subproblem based on this model is solved to obtain a trial point. Moreover, a new descent test criterion is proposed, which can not only simplify the presentation of the algorithm, but also improve the numerical performance significantly. An explicit upper bound for the number of bundle resets is also derived. Global convergence of the algorithm is established, and some preliminary numerical results show that our method is very encouraging.

Partially symmetric nonnegative rectangular tensors and copositive rectangular tensors
Yining Gu and Wei Wu
2019, 15(2): 775-789 doi: 10.3934/jimo.2018070 +[Abstract](3865) +[HTML](1086) +[PDF](376.97KB)

In this paper, we prove a maximum property of the largest H-singular value of a partially symmetric nonnegative rectangular tensor, and establish some bounds for this singular value. Then we give the definition of copositive rectangular tensors. This concept extends from the concept of copositive square tensors. Partially symmetric nonnegative rectangular tensors and positive semi-definite rectangular tensors are examples of copositive rectangular tensors. We establish some necessary conditions and some sufficient conditions for a real partially symmetric rectangular tensor to be a copositive rectangular tensor. We also give an equivalent definition of strictly copositive rectangular tensors. Moreover, some further properties of copositive rectangular tensors are discussed.

Henig proper efficiency in vector optimization with variable ordering structure
Marius Durea, Elena-Andreea Florea and Radu Strugariu
2019, 15(2): 791-815 doi: 10.3934/jimo.2018071 +[Abstract](4357) +[HTML](1026) +[PDF](447.27KB)

In this paper we introduce a notion of Henig proper efficiency for constrained vector optimization problems in the setting of variable ordering structure. In order to get an appropriate concept, we have to explore firstly the case of fixed ordering structure and to observe that, in certain situations, the well-known Henig proper efficiency can be expressed in a simpler way. Then, we observe that the newly introduced notion can be reduced, by a Clarke-type penalization result, to the notion of unconstrained robust efficiency. We show that this penalization technique, coupled with sufficient conditions for weak openness, serves as a basis for developing necessary optimality conditions for our Henig proper efficiency in terms of generalized differentiation objects lying in both primal and dual spaces.

On the global optimal solution for linear quadratic problems of switched system
Jin Feng He, Wei Xu, Zhi Guo Feng and Xinsong Yang
2019, 15(2): 817-832 doi: 10.3934/jimo.2018072 +[Abstract](4151) +[HTML](1405) +[PDF](385.3KB)

The global optimal solution for the optimal switching problem is considered in discrete time, where these subsystems are linear and the cost functional is quadratic. The optimal switching problem is a discrete optimization problem. Complete enumeration search is always required to find the global optimal solution, which is very expensive. Relaxation method is an effective method to transform the discrete optimization problem into the continuous optimization problem, while the optimal solution is always not the feasible solution of the discrete optimization problem. In this paper, we propose a special class of relaxation method to transform the optimal switching problem into a relaxed optimization problem. We prove that the optimal solution of this modified relaxed optimization problem is exactly that of the optimal switching problem. Then, the global optimal solution can be obtained by solving the continuous optimization problem easily. Numerical examples are demonstrated to show that the modified relaxation method is efficient and effective to obtain the global optimal solution.

Exact and heuristic methods for personalized display advertising in virtual reality platforms
Kemal Kilic, Menekse G. Saygi and Semih O. Sezer
2019, 15(2): 833-854 doi: 10.3934/jimo.2018073 +[Abstract](4494) +[HTML](1459) +[PDF](580.74KB)

In this paper, motivated from a real problem faced by an online Virtual Reality (VR) platform provider, we study a personalized advertisement assignment problem. In this platform users log in/out and change their virtual locations. A number of advertisers are willing to pay for ad locations to reach these users. Every time a user visits a new location, the company displays one of the ads. At the end of a fixed time horizon, a reward is collected which depends on the number of ads of each advertiser displayed to different users. The objective is to assign ads dynamically to maximize the expected reward. The problem is studied in a framework where the behaviors of users are modeled with two-state continuous-time Markov processes. We describe two exact and four heuristic algorithms. We compare these algorithms and conduct a sensitivity analysis over problem and algorithm specific parameters. These are the main contributions of the current paper. Exact algorithms suffer from the curse of dimensionality, hence, heuristic methods might be considered instead in some cases. However, exact methods can also be used as part of heuristics since the experimental analysis demonstrates that they are robust for parameters that influence the computational requirements.

An integrated Principal Component Analysis and multi-objective mathematical programming approach to agile supply chain network design under uncertainty
Azam Moradi, Jafar Razmi, Reza Babazadeh and Ali Sabbaghnia
2019, 15(2): 855-879 doi: 10.3934/jimo.2018074 +[Abstract](15723) +[HTML](3654) +[PDF](2223.11KB)

The design of agile supply chain networks has attracted more attention in recent years according to the competitive business environment. Further, due to high degree of uncertainty in agile supply chains (SCs), developing robust and efficient decision making tools are of interest. In this study, an integrated approach based on principal component analysis (PCA) and multi-objective possibilistic mixed integer programming (MOPMIP) approaches is proposed to optimally design agile supply chain network under uncertainty. The PCA method is used for ranking and filtering the suppliers, constituting the first layer of the supply chain, based on agility criteria. The proposed MOPMIP model is employed to construct the agile supply chain network under uncertainty. In the proposed MOPMIP model, three objective functions including 1) total costs minimization, 2) total delivery time minimization and 3) maximization of flexibility are considered. An interactive fuzzy solution approach is used to solve the proposed MOPMILP model. Two numerical examples, is conducted to evaluate the performance and efficiency of the proposed integrated approach for agile supply chain network design under uncertainty.

Test of copositive tensors
Li Li, Xinzhen Zhang, Zheng-Hai Huang and Liqun Qi
2019, 15(2): 881-891 doi: 10.3934/jimo.2018075 +[Abstract](4525) +[HTML](980) +[PDF](378.85KB)

In this paper, an SDP relaxation algorithm is proposed to test the copositivity of higher order tensors. By solving finitely many SDP relaxations, the proposed algorithm can determine the copositivity of higher order tensors. Furthermore, for any copositive but not strictly copositive tensor, the algorithm can also check it exactly. Some numerical results are reported to show the efficiency of the proposed algorithm.

A semidefinite relaxation algorithm for checking completely positive separable matrices
Anwa Zhou and Jinyan Fan
2019, 15(2): 893-908 doi: 10.3934/jimo.2018076 +[Abstract](3862) +[HTML](1250) +[PDF](472.72KB)

A symmetric matrix \begin{document}$A$ \end{document} is completely positive (CP) if there exists an entrywise nonnegative matrix \begin{document}$V$ \end{document} such that \begin{document}$A = VV ^T$ \end{document}. A real symmetric matrix is called completely positive separable (CPS) if it can be written as a sum of rank-1 Kronecker products of completely positive matrices. This paper studies the CPS problem. A criterion is given to determine whether a given matrix is CPS, and a specific CPS decomposition is constructed if the matrix is CPS.

A difference of convex optimization algorithm for piecewise linear regression
Adil Bagirov, Sona Taheri and Soodabeh Asadi
2019, 15(2): 909-932 doi: 10.3934/jimo.2018077 +[Abstract](5165) +[HTML](1690) +[PDF](4569.44KB)

The problem of finding a continuous piecewise linear function approximating a regression function is considered. This problem is formulated as a nonconvex nonsmooth optimization problem where the objective function is represented as a difference of convex (DC) functions. Subdifferentials of DC components are computed and an algorithm is designed based on these subdifferentials to find piecewise linear functions. The algorithm is tested using some synthetic and real world data sets and compared with other regression algorithms.

Global error bounds for the tensor complementarity problem with a P-tensor
Mengmeng Zheng, Ying Zhang and Zheng-Hai Huang
2019, 15(2): 933-946 doi: 10.3934/jimo.2018078 +[Abstract](4433) +[HTML](1210) +[PDF](388.56KB)

As a natural extension of the linear complementarity problem, the tensor complementarity problem has been studied recently; and many theoretical results have been obtained. In this paper, we investigate the global error bound for the tensor complementarity problem with a P-tensor. We give two global error bounds for this class of complementarity problems with the help of two positively homogeneous operators defined by a P-tensor. When the order of the involved tensor reduces to 2, the results obtained in this paper coincide exactly with the one for the linear complementarity problem.

Predicting 72-hour reattendance in emergency departments using discriminant analysis via mixed integer programming with electronic medical records
Fanwen Meng, Kiok Liang Teow, Kelvin Wee Sheng Teo, Chee Kheong Ooi and Seow Yian Tay
2019, 15(2): 947-962 doi: 10.3934/jimo.2018079 +[Abstract](5122) +[HTML](1974) +[PDF](428.99KB)

The proportion of patients who reattended emergency department (ED) within 72 hours is an important indicator of quality of care. This study develops a practical framework to predict patients who will reattend ED in 72 hours from clinical perspectives. We analyze 328,733 ED patients from 1 January 2011 to 31 December 2013, with an average of 4.6% reattendances. We feature over 100 factors including demographics, diagnosis, patient acuity, chief complaints, selected laboratory tests, summarized vital signs. Using univariate analysis, a pool of risk variables is selected for subsequent factor selection. We then apply filter methods to derive a set of candidate factors. With these factors in combination with suggestions from ED clinicians, a mixed integer programming model based on discriminant analysis is proposed to determine a classification rule for 72-hour reattendance. In numerical experiments, various small subsets of risk factors are used for classification and prediction. The results show that favorable predicting performances can be achieved in both training and test sets.

A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
Aviv Gibali, Dang Thi Mai and Nguyen The Vinh
2019, 15(2): 963-984 doi: 10.3934/jimo.2018080 +[Abstract](5455) +[HTML](1546) +[PDF](1670.8KB)

Inspired by the works of López et al. [21] and the recent paper of Dang et al. [15], we devise a new inertial relaxation of the CQ algorithm for solving Split Feasibility Problems (SFP) in real Hilbert spaces. Under mild and standard conditions we establish weak convergence of the proposed algorithm. We also propose a Mann-type variant which converges strongly. The performances and comparisons with some existing methods are presented through numerical examples in Compressed Sensing and Sparse Binary Tomography by solving the LASSO problem.

Predicting non-life insurer's insolvency using non-kernel fuzzy quadratic surface support vector machines
Ye Tian, Wei Yang, Gene Lai and Menghan Zhao
2019, 15(2): 985-999 doi: 10.3934/jimo.2018081 +[Abstract](4602) +[HTML](1324) +[PDF](387.44KB)

Due to the serious consequence caused by insurers' insolvency, how to accurately predict insolvency becomes a very important issue in this area. Many methods have been developed to do this task by using some firm-level financial information. In this paper, we propose a new approach which incorporates several macroeconomic factors in the model and applies feature selection to eliminate the bad effect of some unrelated variables. In this way, we can obtain a more comprehensive and accurate model. More importantly, our method is based on the state-of-the-art non-kernel fuzzy quadratic surface support vector machine (FQSSVM) model which not only performs superiorly in prediction, but also becomes very applicable to the users. Finally, we conduct some numerical experiments based on the real data of non-lifer insurers from USA to show the predictive power and efficiency of our proposed method compared with other benchmark methods. Specifically, in a reasonable computational time, FQSSVM has the most accurate prediction rate and least Type Ⅰ and Type Ⅱ errors.

2021 Impact Factor: 1.411
5 Year Impact Factor: 1.441
2021 CiteScore: 2.1




Email Alert

[Back to Top]