2015 Vol.19

Please wait a minute...


For Selected: Download Citations EndNote Ris BibTeX Toggle Thumbnails

Select

Characterizations of two classes of cone generalized pseudoinvexity TANG Liping, YANG Xinmin Operations Research Transactions    2015, 19 (1): 1-8.   Abstract （654）      PDF（pc） （436KB）（760）       Knowledge map    Save In this paper, a class of nonsmooth vector optimization problem with constraints is considered. The concepts of FJ-pseudoinvexity-I(II) in the sense of cone are introduced;  Gordan's theorem over general cone domains is established; and then, FJ-pseudoinvexity-I(II) are characterized by the relationships between FJ vector critical points and the (weak) efficient solutions of nonsmooth vector optimization. Reference | Related Articles | Metrics | Comments（0）

Select

Existence and stability of weakly Pareto-Nash equilibrium points for information sets generalized multiobjective games JIA Wensheng, XIANG Shuwen Operations Research Transactions    2015, 19 (1): 9-17.   Abstract （815）      PDF（pc） （510KB）（684）       Knowledge map    Save In this paper, the information sets generalized multiobjective game model is established by introducing information sets to the multiobjective game, and it is presented that the generalized multiobjective game, the generalized $n$-person game, the n-person noncooperative finite game as some special cases of  the information sets generalized multiobjective game. Then the existence theorem of weakly Pareto-Nash equilibrium points for the information sets generalized multiobjective game is proved by using Fan-Glicksberg fixed point theorem. Furthermore,  from the viewpoint of the essential solution and strongly essential solution, we prove that the generic stability and the existence of strongly essential component for information sets generalized multiobjective games. Reference | Related Articles | Metrics | Comments（0） Cited: Baidu(9)

Select

A non-interior-point continuous algorithm with superlinear convergence for second-order cone programming ZENG Youfang, TANG Chunming Operations Research Transactions    2015, 19 (1): 18-30.   Abstract （647）      PDF（pc） （575KB）（441）       Knowledge map    Save In this paper, based on a new smoothing function of the well-known nonsmooth vector-valued min-function, a non-interior-point continuous algorithm for second-order cone programming is presented. The features of this method are as follows: firstly, the starting point can be chosen arbitrarily; secondly, at each iteration, only one system of linear equations is performed for searching an improving direction; finally, global, strong and superlinear convergence are obtained without assumption of strict complementarity. The numerical results demonstrate the effectiveness of the algorithm. Reference | Related Articles | Metrics | Comments（0）

Select

A multi-objective method for supplier pre-selection of platform-based products MU Lifeng, CAO Yan Operations Research Transactions    2015, 19 (1): 31-44.   Abstract （657）      PDF（pc） （1704KB）（658）       Knowledge map    Save To a manufacture company, supplier selection is always a crucial decision problem which directly impacts the final profits of a company. In previous studies, suppliers are selected only from the view of particular components rather than the whole product. In addition, supplier selection is usually conducted in the stage of product production after the stage of product design in traditional process of product development. However, taking into consideration of supplier selection in the early stage of product development can effectively avoid the shortage of appropriate suppliers. In this paper, a new multi-objective approach to preliminary selection of supplier based on products platform is proposed and a multi-objective optimization model with the objectives of minimizing outsourcing cost, supply risk and leading time of product family from the perspective of whole product is established to help decision-makers improve the overall scheme of product design in early time of product development. In addition, the optimization model takes the impact of component-sharing into consideration, which is common in the product platform, on the result of preliminary selection of suppliers. NSGA-II algorithm is adopted to solve the established optimization model, and a case study is provided to illustrate the rationality and effectiveness of the proposed method and algorithm. Reference | Related Articles | Metrics | Comments（0）

Select

A hybrid method for a system of nonlinear equations with bound constraints LIU Yuanwen, OU Yigui Operations Research Transactions    2015, 19 (1): 45-56.   Abstract （788）      PDF（pc） （1215KB）（772）       Knowledge map    Save Based on the nonmonotone technique and the Levenberg-Marquard method, this paper presents a new hybrid method for solving a system of nonlinear equations with bound constraints. Under some reasonable assumptions, the proposed algorithm is proven to be globally convergent. Preliminary numerical results indicate that this algorithm is effective. Reference | Related Articles | Metrics | Comments（0）

Select

Laplacian spectral characterizations of unicyclic graphs  H( p, t K_{ 1, m}) MEI Ruoxing, WANG Ligong, WANG Luhua, WANG Zhanqing Operations Research Transactions    2015, 19 (1): 57-64.   Abstract （624）      PDF（pc） （732KB）（604）       Knowledge map    Save  Let $H(p,tK_{1,m})$ be a connected unicyclic graph with $p+mt$ vertices obtained from $C_{p}$ by attaching the center of star $K_{1,m}$ to each one of $t$ mutual adjacent vertices of the cycle $C_{p}$, respectively. In this paper, it is proved that the unicyclic graphs $H(p,p K_{1,4})$, $H(p,p K_{1,3})$, $H((p,(p-1) K_{1,3} )$ are determined by their Laplacian spectra, and when $ p $ is even number, the unicyclic graphs $H(p,2 K_{1,3})$, $H(p,(p-2)K_{1,3})$, $H(p,(p-3)K_{1,3})$ are also determined by their Laplacian spectra. Reference | Related Articles | Metrics | Comments（0）

Select

Multiperiod mergers and acquisitions (M{\&}A) decision in consideration of efficiency and scale under the incomplete information SHI Hailiu, WANG Yingming, CHEN Shengqun Operations Research Transactions    2015, 19 (1): 65-76.   Abstract （632）      PDF（pc） （654KB）（560）       Knowledge map    Save For problem of incomplete information and multiperiod information existing in the process of mergers and acquisitions (M{\&}A), an approach of enterprises M{\&}A decision is proposed in consideration of efficiency and scale. Incomplete and multiperiod evaluation information of two sides involving in M{\&}A is aggregated using evidence reasoning (ER), and whether the scale of a merger enterprise is too large is determined using DEA method, which is used to select feasible M{\&}A scheme, then the best targets is determined according to the value of competitive cross-efficiency of M{\&}A scheme. Finally, an illustrative example is given to show the feasibility and validity of the proposed method. Reference | Related Articles | Metrics | Comments（0）

Select

The strongly quasi \alpha-preinvex functions WANG Haiying, FU Zufeng Operations Research Transactions    2015, 19 (1): 77-84.   Abstract （740）      PDF（pc） （475KB）（509）       Knowledge map    Save In this paper, one important type of generalized convex functions termed as strongly quasi $\alpha$-preinvex functions is studied. The relationships among strongly quasi $\alpha$-preinvex functions and quasi $\alpha$-preinvex functions, and strictly quasi $\alpha$-preinvex functions and semistrictly quasi $\alpha$-preinvex functions have been discussed. Three important theorems of properties have been obtained for it on the middle point strongly quasi $\alpha$-preinvexity. We also present two important applications in terms of strongly quasi $\alpha$-preinvex functions in mathematical programming. These results complete the researches for the strongly quasi $\alpha$-preinvex functions to some extent. Reference | Related Articles | Metrics | Comments（0）

Select

The optimal management for defined benefit  pension of funds based on a Heston model XIAO Jianwu Operations Research Transactions    2015, 19 (1): 85-91.   Abstract （873）      PDF（pc） （855KB）（701）       Knowledge map    Save The portfolio decision and contribution plan are the paramount important problems of the defined benefit pension funds. So the paper creates a Heston stochastic volatility model for the defined pension funds management, and transfers the primal problem to the dual problem by applying optimal control theory and the Legendre transform. It provides an analytic solution to the primal optimal problem by studying the dual problem. At last, an optimal asset allocation strategy (between a risky asset and a riskless asset) and the least contribution policy are obtained. Reference | Related Articles | Metrics | Comments（0）

Select

The weakly pseudocontinuous of vector-valued functions and the application in multi-objective games ZHANG Guang, WU Donghua, GAO Jing Operations Research Transactions    2015, 19 (1): 92-98.   Abstract （685）      PDF（pc） （527KB）（557）       Knowledge map    Save In this paper, based on the study of pseudocontinuous real-valued functions, a definition of the weakly pseudocontinuous of vector-valued functions on cone is proposed. And a weakly pseudocontinuous relationship is established between the vector-valued functions on $R_+^k$ and the real-valued functions. As an application of the weakly pseudocontinuous of vector-valued functions on cone, the existence theorem of weakly Pareto-Nash equilibrium in multi-objective games with the pseudocontinuous payoffs is proved by the improved vector-valued Ky Fan points. Reference | Related Articles | Metrics | Comments（0）

Select

The sum of squares of the machine completion times minimization scheduling problem on two identical parallel machines GU Cunchang, ZHANG Yuzhong Operations Research Transactions    2015, 19 (1): 99-107.   Abstract （708）      PDF（pc） （631KB）（467）       Knowledge map    Save  In the process of two competitive companies zero-sum game, maximize the product of the two company proceeds, equivalent to minimize the sum of the squares of the machine completion times on two identical parallel machines. We consider an off-line modified delayed-start LPT algorithm: firstly, renumber the jobs in the non-decreasing processing time order; secondly, if the total processing time $P(2m)$ of the longest $2m$ jobs is less than $(2m+1)p_{2m+1}$, schedule the first $2m+1$ jobs optimally followed by the remaining jobs scheduled according to the LPT rule; otherwise, $P(2m)$ is not less than $ (2m+1)p_{2m+1}$, schedule the first $2m$ jobs optimally followed by the remaining jobs scheduled according to the LPT rule. We prove that the worst case ratio of this algorithm is not greater than $1+ (\frac{1}{2m+2} )^2$, and the bound is tight. Reference | Related Articles | Metrics | Comments（0）

Select

Balanced judicious partitions of graphs with $\Delta($G$)-\delta($G$)\leq$2 HU Xiaochen, HE Weili, HAO Rongxia Operations Research Transactions    2015, 19 (1): 108-116.   Abstract （836）      PDF（pc） （493KB）（717）       Knowledge map    Save A bipartition $V_{1}$ and $V_{2}$ of $V(G)$ of a graph $G$ is balanced if $||V_{1}|-|V_{2}||\leq1$. Bollob\'{a}s and Scott conjectured that every graph with $m$ edges and minimum degree at least 2 admits a balanced bipartition $V_{1}$, $V_{2}$ such that {\rm max}$\{e(V_{1}), e(V_{2})\}\leq\frac{m}{3}$, where $e(V_{i})$ denoted the number of edges of $G$ with both ends in $V_{i}(i=1, 2)$. They showed that this conjecture held for regular graphs(i.e., when $\Delta(G)=\delta(G)$). Yan Juan and Xu Baogang showed that every ($k$, $k-1$)-biregular graph(i.e., $\Delta(G)-\delta(G)\leq1$) admitted a balanced bipartition into $V_{1}$, $V_{2}$ with about $\frac{m}{4}$ edges in each vertex class. In this paper we extend this result to graphs with $\Delta($G$)-\delta($G$)\leq2$. Reference | Related Articles | Metrics | Comments（0）

Select

Parallel approximate subgradient projection algorithm for convex feasibility problem DANG Yazheng, XUE Zhonghui Operations Research Transactions    2015, 19 (1): 117-124.   Abstract （837）      PDF（pc） （519KB）（632）       Knowledge map    Save In this paper, a relaxed parallel $\varepsilon$-subgradient projection algorithm which includes the over-relaxed case  and an accelerated parallel $\varepsilon$-subgradient projection algorithm  for solving convex feasibility problem (CFP) are presented. Compared with the previous subgradient projection algorithms, the algorithms presented in this paper use parallel process, i.e. in each iteration consider several approximation subgradient projections simultaneously.  Algorithms adopt over-relaxed iterative process and accelerated technique. Hence, they can reduce the amounts of data storage and   improve the convergence speed.  And we also discuss the convergence of the methods under some mild conditions. Finally, the results of numerical experiment indicate that the  algorithms are valid and have faster convergence speed than that of the algorithm in [18]. Reference | Related Articles | Metrics | Comments（0） Cited: Baidu(1)

Select

Edge colourings of embedded special graphs SUN Lin, LUO Zhaoyang Operations Research Transactions    2015, 19 (1): 125-130.   Abstract （647）      PDF（pc） （478KB）（539）       Knowledge map    Save Let $G$ be a graph embedded on a surface $\Sigma$ of Euler characteristic $\chi(\Sigma)\!\geq\!0$.\\ $\chi'(G)$ and $\Delta(G)$ denote the chromatic index and the maximum degree of $G$, respectively. The paper shows that $\Delta(G)=\chi'(G)$ if the graph $G$ with $\Delta(G)\geq 4$ satisfies the following properties: (1) any two triangles with distance at least two; (2) any $i$-cycle and $j$-cycle with distance at least one, $i,j\in\{3,4\}$; (3) $G$ contains no $5$-cycles. Reference | Related Articles | Metrics | Comments（0）

Select

Approximation algorithms for the  priority facility location problem with submodular penalties WANG Ying, WANG Fengmin, XU Dachuan, XU Wenqing Operations Research Transactions    2015, 19 (2): 1-14.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.001 Abstract （1086）      PDF（pc） （647KB）（1736）       Knowledge map    Save In this paper, we study priority facility location problem with submodular penalties where each client has a level-of-service requirement. An open facility must satisfy the requirement of the clients served by it, and there is a submodular penalty cost corresponding with the unserved clients. The objective is to minimize the sum of the opening cost, the connection cost and the submodular penalty cost. We present the integer program, the linear programming relaxation and the dual program for the problem. Using the primal-dual and greedy augmentation techniques, we then propose two approximation algorithms and obtain the approximation ratios of 3 and 2.375 respectively. Reference | Related Articles | Metrics | Comments（0）

Select

Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints YE Min, WU Zhiyou, ZHANG Liang Operations Research Transactions    2015, 19 (2): 15-28.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.002 Abstract （1340）      PDF（pc） （592KB）（1410）       Knowledge map    Save In this paper, the global optimality conditions and optimization methods for cubic polynomial optimization problems with linear inequality  constraints are considered. Firstly,  we propose a necessary global optimality condition for cubic polynomial optimization problems with linear inequality constraints. Then, a new local optimization method (or called  strongly local optimization methods) is presented by using its necessary global optimality conditions. A global optimization method is proposed for cubic polynomial optimization problems with linear inequality constraints by combining the new local optimization methods together with some auxiliary functions. Finally, some numerical examples are given to illustrate that these approaches are efficient. Reference | Related Articles | Metrics | Comments（0） Cited: Baidu(4)

Select

A global optimization method for solving the linear semivectorial bilevel programming problem LV Yibing, WAN Zhongping Operations Research Transactions    2015, 19 (2): 29-36.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.003 Abstract （965）      PDF（pc） （556KB）（1410）       Knowledge map    Save In this paper, we are concerned with global optimization approach for solving the linear semivectorial bilevel programming (LSBP) problem. Using the duality gap of the lower level programs, we construct the corresponding penalized problem. By analyzing the relationships between the optimal solutions of the original problem and the vertices of the feasible region of the penalized problem, we transform the LSBP problem to a series of linear programming problems. Then, the global optimal solution of the LSBP problem can be obtained by solving a series of linear programming problems. The numerical results show that the algorithm proposed is feasible to the LSBP problem. Reference | Related Articles | Metrics | Comments（0）

Select

A review of re-entrant scheduling problems JING Caixia, ZHAO Congli, YUAN Erming Operations Research Transactions    2015, 19 (2): 37-44.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.004 Abstract （1055）      PDF（pc） （1205KB）（1349）       Knowledge map    Save In contrast to the classical scheduling assumption that each job visits each machine once at most, jobs with reentrant style are of a new type of scheduling problems. The basic characteristic of a re-entrant problem is that a job visits certain machines more than once. Re-entrance is usually found in semiconductor manufacturing, and also many other fields. Recently many papers have dealt with the re-entrant scheduling problems. Results and contributions of these references are presented and analyzed in this paper. The contents and methods are classified and introduced according to the machine environments, including single machine, flow shop, flexible flow shop and others. Research directions and trends of re-entrant scheduling problems in the future are presented  at last. Reference | Related Articles | Metrics | Comments（0）

Select

The Harary index of tricyclic graphs CAI Gaixiang, XING Baohua, YU Guidong Operations Research Transactions    2015, 19 (2): 45-53.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.005 Abstract （1191）      PDF（pc） （1318KB）（1336）       Knowledge map    Save The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a  graph. Tricyclic graphs are  connected graphs in which the number of edges equals the number of vertices plus two. In this paper, we determine graphs with the largest Harary index among all the tricyclic graphs, and we also give graphs with the second largest Harary index among all the tricyclic graphs with three cycles. Reference | Related Articles | Metrics | Comments（0） Cited: Baidu(1)

Select

Two results for single-machine two-agent scheduling problems WAN Long Operations Research Transactions    2015, 19 (2): 54-60.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.006 Abstract （927）      PDF（pc） （475KB）（1268）       Knowledge map    Save The paper considers two two-agent scheduling problems on a single machine. For the first two-agent scheduling problem, the objective of agent A is to minimize the total weighted completion time of all jobs of agent A while the objective of agent B is to minimize the maximum cost of the jobs of agent B. For the second two-agent scheduling problem, the objective of agent A is to minimize the total completion time of all jobs of agent A while the objective of agent B is to minimize the makespan which is defined as the maximum completion time of all the jobs of agent B. In this paper, we prove that the first problem is NP-hard in the strong sense which improves the current complexity result and design a dynamic programming other than the previous known algorithm for the second problem. Reference | Related Articles | Metrics | Comments（0） Cited: Baidu(1)

Select

Properties and solving method of  tau-value for fuzzy cooperative games with multilinear extension form YANG Dianqing, LI Dengfeng Operations Research Transactions    2015, 19 (2): 61-71.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.007 Abstract （996）      PDF（pc） （562KB）（1262）       Knowledge map    Save In this paper, we research the solving method and properties of  tau-value for fuzzy cooperative games. Using the multilinear extensive method, we define the tau-value for fuzzy cooperative games, prove its existence, uniqueness and other properties, and deduce the computational formulae of the  tau-value for convex fuzzy cooperative games. The research result shows that the  tau-value for the fuzzy cooperative games with multilinear extension form is an extension of the  tau-value for crisp cooperative games. Especially, for the convex fuzzy cooperative games, the computational process of the  tau-value can be simplified. Reference | Related Articles | Metrics | Comments（0）

Select

A scheduling strategy for dynamic vehicle routing problem based on double chains coding NING Tao, CHEN Rong, GUO Chen, LIANG Xu Operations Research Transactions    2015, 19 (2): 72-82.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.008 Abstract （831）      PDF（pc） （2109KB）（1298）       Knowledge map    Save For the purpose of solving the scheduling of dynamic vehicle routing problem, this paper establishes the simulation model to minimize the cost and stability value and maximize the freight rate, and an improved hybrid multi-phases quantum particle swarm algorithm was proposed. Firstly, it proposes the method of double chains structure coding including vehicle allocation chain and goods chain. Secondly, it proposes a dynamic scheduling strategy based on period-driven and event-driven. Finally, a novel method is applied to a dynamic simulation and the result of comparing with other classical algorithms verifies its effectiveness. Reference | Related Articles | Metrics | Comments（0） Cited: Baidu(3)

Select

Global optimality conditions for non-convex cubic minimization problem with binary constraints ZHANG Liang,WANG Yan,LI Guoquan Operations Research Transactions    2015, 19 (2): 83-90.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.009 Abstract （765）      PDF（pc） （475KB）（1197）       Knowledge map    Save In this paper, we consider a special non-convex cubic optimization problem with binary constraints, and present a global optimal necessary and sufficient condition for this special non-convex cubic optimization problem. The results of this paper extend some corresponding results on global optimality conditions in some references in present information. Numerical examples show that the global optimal necessary and sufficient condition can effectively determine the optimal solution for the non-convex cubic optimization problem. Reference | Related Articles | Metrics | Comments（0）

Select

Upper bounds of the arc-chromatic number of tournaments XU Chuandong,ZHANG Shenggui,WANG Yi Operations Research Transactions    2015, 19 (2): 91-98.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.010 Abstract （755）      PDF（pc） （1610KB）（1127）       Knowledge map    Save The arc-chromatic number of a digraph is the smallest number of colors required in an arc-coloring such that no two consecutive arcs get the same color. We first introduce some results on the arc-coloring of digraphs, then give a discussion about the upper bound of the arc-chromatic number of tournaments. By determining the maximum arc-chromatic number of tournaments with order at most $8$, we show that although the upper bound of the arc-chromatic number of general digraphs is tight, it is not tight for tournaments. Reference | Related Articles | Metrics | Comments（0）

Select

The maximum signless Laplacian separator of unicyclic and bicyclic graphs JIAN Xiangguo,YUAN Xiying,ZHANG Man Operations Research Transactions    2015, 19 (2): 99-104.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.011 Abstract （912）      PDF（pc） （799KB）（1206）       Knowledge map    Save Let G be a graph of order n and q_{1}(G)\geq q_{2}(G)\geq \cdots \geq q_{n}(G) be its Q-eigenvalues. The signless Laplacian separator  S_{Q}(G) of G is defined as S_{Q}(G)=q_{1}(G)-q_{2}(G). In this paper, we study the maximum signless Laplacian separator of unicyclic and bicyclic graphs and characterize the extremal graphs, respectively. Reference | Related Articles | Metrics | Comments（0）

Select

A characterization of weakly (C,\varepsilon)-efficient solution of vector optimization via nonlinear scalarization GUO Hui Operations Research Transactions    2015, 19 (2): 105-110.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.012 Abstract （829）      PDF（pc） （430KB）（1216）       Knowledge map    Save Recently, Guti\'{e}rrez et al. proposed a new type of efficiency based on co-radiant set which called (C,\varepsilon)-efficient solution in vector optimization. This new notion of efficiency unifies some well-known concepts introduced previously in the literature. In this paper, we characterizes the new (C,\varepsilon)-efficient solution by a nonlinear scalarization function proposed by G\"{o}pfert, et al. Furthermore, an example is given to illustrate our main result. Reference | Related Articles | Metrics | Comments（0）

Select

Capacitated house market model with tenant under weak preferences WU Weirang,CHEN Jinyang,WENG Yalan Operations Research Transactions    2015, 19 (2): 111-126.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.013 Abstract （504）      PDF（pc） （2042KB）（1473）       Knowledge map    Save In this paper, the capacitated house market model with tenant under weak preferences problem has been considered. According to this model, we propose a kind of algorithm mechanism which is the extension of TTC algorithm, known as the Remove Selection algorithm(called CTTC) mechanism. In addition, we show that this kind of mechanism by using CTTC of the model satisfies individual rationality, Pareto-efficient and strategy-proof, and the complexity of CTTC algorithm is O(n_{1}^{2}(n_{1}n_{2}+n_{2}^{2})), where n_{1} is the number of agents, n_{2} is the number of the house. Reference | Related Articles | Metrics | Comments（0）

Select

A historical review on the research and development GUAN Meigu Operations Research Transactions    2015, 19 (3): 1-7.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.001 Abstract （1990）      PDF（pc） （461KB）（1228）       Knowledge map    Save The Chinese postman problem is one of the fundamental problems in operations research. This paper reviews the development of the problem, starting from its inception to its current status. Reference | Related Articles | Metrics | Comments（0）

Select

Maximal and minimal probabilities of the majority satisfaction jury theorem QIN Zhilin, YU Liying Operations Research Transactions    2015, 19 (3): 8-17.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.002 Abstract （800）      PDF（pc） （506KB）（386）       Knowledge map    Save This paper proves that when the probabilities of individuals in the group correctly judging satisfaction of alternatives are more dispersed that corresponding to the group using the majority satisfactory rule will have a higher probability. According to this result, we get the expressions of maximal probability and minimal probability of the group determined by majority satisfaction jury theorem on average probability of all individuals correctly judging satisfaction of alternatives has same. Reference | Related Articles | Metrics | Comments（0）

Select

International crude prices forecast of double random integer programming model,algorithm and application DONG Zhenyu, FENG Enmin, YIN Hongchao, ZHANG Yuduo Operations Research Transactions    2015, 19 (3): 18-25.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.003 Abstract （946）      PDF（pc） （685KB）（683）       Knowledge map    Save According to the international price of crude oil and its change of recent data,  we give the matrix of the amount of international crude oil prices change state transition probability (or frequency). According to the international crude oil price forecasting error minimum expectation and variance as the optimal target, taking the international crude oil price forecasting error minimum expectation and variance as the optimal index, a double random integer programming model to predict the price of international crude oil is proposed. Then  we discuss the existence of optimal solution. According to the constraint characteristics optimization algorithm is constructed.  At the same time, according to the current domestic refined oil pricing mechanism,  we predict the domestic refined oil price adjustment  by applying the  optimization algorithm which is proposed in this paper. The empirical analysis shows that the model in this paper is of certain accuracy and practicability of the optimization algorithm. Reference | Related Articles | Metrics | Comments（0）

Select

A smoothing objective penalty function algorithm for  bilevel programming problems MENG Zhiqing, SHEN Rui, XU Xinsheng, JIANG Min Operations Research Transactions    2015, 19 (3): 26-33.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.004 Abstract （701）      PDF（pc） （419KB）（562）       Knowledge map    Save In this paper, a novel smoothing objective penalty function is introduced for bilevel programming problems. It is proved that an optimal solution to the smoothing objective penalty optimization problem is also an optimal solution to the riginal bilevel programming problem under some mild conditions. Furthermore, for the bilevel programming problems with convexity to the lower level problem, an algorithm based on the proposed method is introduced, its convergence is proved. Reference | Related Articles | Metrics | Comments（0）

Select

Some properties on Pareto-eigenvalues of higher-order tensors XU Feng, LING Chen Operations Research Transactions    2015, 19 (3): 34-41.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.005 Abstract （967）      PDF（pc） （452KB）（628）       Knowledge map    Save We consider the higher-order tensor eigenvalue complementarity problem (TEiCP). Since finding the largest Pareto-eigenvalue of tensor is NP-hard in general, in this paper we focus on studying the estimation of the Pareto-eigenvalue. We also present some properties for Pareto-eigenvalues of Z-tensors and M-tensors. Reference | Related Articles | Metrics | Comments（0）

Select

On parametric representations of the efficient set of multiple objective mathematical programming problems SUN Erjiang Operations Research Transactions    2015, 19 (3): 42-47.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.006 Abstract （675）      PDF（pc） （354KB）（516）       Knowledge map    Save In this paper we present some new results that characterize the efficient solutions of a p-dimensional multiple objective mathematical programming (MOMP). These characterizations are in terms of the optimal solutions of appropriate scalar optimization problems or in terms of efficient solutions of appropriate (p-1)-dimensional parametric MOMP. Reference | Related Articles | Metrics | Comments（0）

Select

A new QP-free method without a penalty function and a filter PU Dingguo, SHANG Youlin, WANG Guanlin Operations Research Transactions    2015, 19 (3): 48-56.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.007 Abstract （644）      PDF（pc） （434KB）（436）       Knowledge map    Save  In this paper, we propose a new QP-free infeasible method based on the solution of nonsmooth equations which  are obtained by the multipliers and the piecewise linear relationship NCP function for the KKT first-order optimality conditions. We do not use  a penalty function and a filter on line search. Locally, each iteration of this method can be viewed as a perturbation of the mixed Newton-quasi Newton iteration on both  primal and dual variables for the solution of  KKT optimality conditions. This method is  implementable and globally convergent. Without the second  order correction we  prove that the  method has superlinear convergence rate under some mild conditions. Reference | Related Articles | Metrics | Comments（0）

Select

Modified alternating directions method of multipliers for convex optimization with three separable functions HE Bingsheng Operations Research Transactions    2015, 19 (3): 57-70.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.008 Abstract （1051）      PDF（pc） （547KB）（673）       Knowledge map    Save In this paper, we indicate the reason of divergence, and illustrate the strategies which modify the alternating direction method of multipliers (ADMM) to a convergent one for the linearly constrained separable convex optimization with three individual functions. Finally, using a uniform framework, we give the simple proofs for the convergence and O(1/t) convergence rate in the ergodic sense of the ADMM-like methods. Reference | Related Articles | Metrics | Comments（0）

Select

An optimized urban traffic signal field control algorithm based on pseudo neural network HUANG Jiaqian, HONG Zhenjie, FAN Jinsong Operations Research Transactions    2015, 19 (3): 71-77.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.009 Abstract （820）      PDF（pc） （582KB）（496）       Knowledge map    Save We propose an optimization model and its corresponding parallel algorithm for optimized signal-planning. Based on a local enumeration method, the algorithm adds a virtual guiding penalty, which is derived from the traffic weight. This makes the algorithm has a global spatial and temporal optimized property. In the situation of saturated or over-saturated traffic status, this algorithm outperforms the traditional single-point intersection control method. Reference | Related Articles | Metrics | Comments（0）

Select

On “An efficient implementation of the face algorithm for linear programming” PAN Pingqi Operations Research Transactions    2015, 19 (3): 78-84.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.010 Abstract （771）      PDF（pc） （355KB）（433）       Knowledge map    Save Zhang et al recently propose another approach to Pan's face algorithm. This work gives a modification of the result. Reference | Related Articles | Metrics | Comments（0）

Select

An augmented proximity stress model for edge label overlap removal HU Yifan Operations Research Transactions    2015, 19 (3): 85-95.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.011 Abstract （684）      PDF（pc） （499KB）（418）       Knowledge map    Save  When drawing graphs whose edges and nodes both contain text or graphics, such information needs to be displayed without overlaps, either as part of the initial layout or as a post-processing step. The core problem in removing overlaps lies in retaining the structural information inherent in a layout, minimizing the additional area required, and keeping edges as straight as possible. This paper presents a combined node and edge overlap removal algorithm that aims at offering one solution to this problem, based on minimizing a cost function that both reduces topological changes to the original drawing, and  keeps edges straight. Reference | Related Articles | Metrics | Comments（0）

Select

A pattern search filter method for linearly equality-constrained optimization problems CHEN Ning, SUN Wenyu, YUAN Jinyun Operations Research Transactions    2015, 19 (3): 96-107.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.012 Abstract （936）      PDF（pc） （496KB）（582）       Knowledge map    Save In this paper a pattern search filter algorithm for linearly equality-constrained derivative-free optimization is proposed. In this work we embed a filter technique in a derivative-free optimization algorithm which improves the efficiency of algorithms. The global convergence of new algorithm is established. Initial numerical results show that the new algorithm is efficient. Reference | Related Articles | Metrics | Comments（0）

Select

A face recognition method based on discriminative hypergraph and nonnegative matrix factorization ZHANG Xinyue, HUANG Zhenghai, LI Zhiming Operations Research Transactions    2015, 19 (3): 108-115.   DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.013 Abstract （890）      PDF（pc） （516KB）（489）       Knowledge map    Save Nonnegative matrix factorization (NMF) has become a popular data representation method and has been widely used in image processing and pattern recognition problems. However, NMF ignores the local geometric structure of data. Existing simple graph-based transductive learning only considering the image information in pairs, and they are sensitive to the radius parameter used in similarity calculation. Hypergraph learning has been investigated to solve the problems. Hypergraph models the high-order relationship of samples by using the hyperedges to link multiple samples. However, most of the existing hypergraph learning methods are unsupervised methods. Based on the discriminative hypergraph and nonnegative matrix factorization, we propose a new model and solve the new model by using the alternating direction method of multipliers. The new method, together with the nearest neighbor method, is applied to face recognition. Experimental results on several standard face datasets show the effectiveness of our method. Reference | Related Articles | Metrics | Comments（0）

• page
• Page 1 of 2
• Total 57 records
• First page
• Prev page
• Next page
• Last page