期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到362篇文章
< 1 2 … 19 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Improved Polytope Generation for CRC-Aided Adaptive Linear Programming Polar Decoding 认领 引用
1
作者 Xie Mutong Du Zhongze +2 位作者 Zou Guoxue Tian Lin Yuan Jinhong 《China Communications》 SCIE EI CSCD 2025年第12期124-136,共13页
Linear programming(LP)decoding is a classic decoding method for linear block codes,and has attracted recent researches because its potential in joint channel processing.However,for polar codes,LP decoders has long bee... Linear programming(LP)decoding is a classic decoding method for linear block codes,and has attracted recent researches because its potential in joint channel processing.However,for polar codes,LP decoders has long been outperformed by CRCaided successive cancellation list(CA-SCL)decoders.To increase the competitiveness of 5G NR LP polar decoding,it is possible to gain performance improvements by exploiting the cyclic redundancy check(CRC)setup.In this paper,we propose a combined scheme of reduced sparsified factor graph-sparsified CRC(RSFG-SCRC)and augmented generator matrix-CRC(AGM-CRC),for polytope generation in adaptive linear programming(ALP)decoder for 5G polar codes.Augmented generator matrix(AGM)polytope and improved maximum cycle strategy-auxiliary node pairs 4(MCS-ANP-4)algorithm are proposed,to make efficient use of CRC constraints and minimize the constraint size for the decoder.Numerical simulations show that adaptive linear programming decoders with our proposed RSFG-SCRC and AGM-CRC polytopes can achieve significantly better block error rate(BLER)performance than a benchmark CA-SCL-8 decoder especially in harsh low-to-medium SNR regions. 展开更多
关键词 codeword polytope cyclic redundancy check 5G NR linear programming decoding polar code
暂未订购 下载PDF
A KIND OF FUZZY LINEAR PROGRAMMING PROBLEMS BASED ON INTERVAL-VALUED FUZZY SETS 认领 引用 被引量：1
2
作者 Xu Jiuping 《Applied Mathematics(A Journal of Chinese Universities)》 2000年第1期65-72,共8页
The objective of this paper is to deal with a kind of fuzzy linear programming problem based on interval\|valued fuzzy sets(IVFLP)through the medium of procedure that turns IVFLP into parametric linear programming via... The objective of this paper is to deal with a kind of fuzzy linear programming problem based on interval\|valued fuzzy sets(IVFLP)through the medium of procedure that turns IVFLP into parametric linear programming via the mathematical programming.Some useful results for the benefit of solving IVFLP are expounded and proved,developed and discussed.Furthermore,that the proposed techniques in this paper allow the decision\|maker to assign a different degree of importance can provide a useful way to efficiently help the decision\|maker make their decisions. 展开更多
关键词 Fuzzy linear programming interval-valued fuzzy sets parametric linear programming Fuzzy decision-m aking uncertainty.
暂未订购 下载PDF
Solving Fuzzy Multi-Objective Linear Programming Problem by Applying Statistical Method 认领 引用 被引量：1
3
作者 Samsun Nahar Marin Akter Md. Abdul Alim 《American Journal of Operations Research》 2022年第6期293-309,共17页
In this paper, the statistical averaging method and the new statistical averaging methods have been used to solve the fuzzy multi-objective linear programming problems. These methods have been applied to form a single... In this paper, the statistical averaging method and the new statistical averaging methods have been used to solve the fuzzy multi-objective linear programming problems. These methods have been applied to form a single objective function from the fuzzy multi-objective linear programming problems. At first, a numerical example of solving fuzzy multi-objective linear programming problem has been provided to validate the maximum risk reduction by the proposed method. The proposed method has been applied to assess the risk of damage due to natural calamities like flood, cyclone, sidor, and storms at the coastal areas in Bangladesh. The proposed method of solving the fuzzy multi-objective linear programming problems by the statistical method has been compared with the Chandra Sen’s method. The numerical results show that the proposed method maximizes the risk reduction capacity better than Chandra Sen’s method. 展开更多
关键词 Fuzzy Multi-Objective Linear Programming Problem Fuzzy Linear Programming Problem Chandra Sen’s Method Statistical Averaging Method New Statistical Averaging Method
暂未订购 下载PDF
An adaptive genetic algorithm for solving bilevel linear programming problem 认领 引用 被引量：2
4
作者 王广民 王先甲 +1 位作者 万仲平 贾世会 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2007年第12期1605-1612,共8页
Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this pr... Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this problem. Of all the algorithms, the ge- netic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes maybe infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references. 展开更多
关键词 bilevel linear programming genetic algorithm fitness value adaptive operator probabilities crossover and mutation
暂未订购 下载PDF
Efficient Algorithm for K-Barrier Coverage Based on Integer Linear Programming 认领 引用 被引量：16
5
作者 Yanhua Zhang Xingming Sun Baowei Wang 《China Communications》 SCIE CSCD 2016年第7期16-23,共8页
Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied af... Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach. 展开更多
关键词 k-barrier coverage linear programming wireless sensor networks
暂未订购 下载PDF
Smoothing Newton Algorithm for Linear Programming over Symmetric Cones 认领 引用 被引量：3
6
作者 刘晓红 倪铁 《Transactions of Tianjin University》 EI CAS 2009年第3期216-221,共6页
By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algor... By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algorithm is globally convergent under suitable assumptions. 展开更多
关键词 linear programming symmetric cone Euclidean Jordan algebra smoothing algorithm
暂未订购 下载PDF
Global convergent algorithm for the bilevel linear fractional-linear programming based on modified convex simplex method 认领 引用 被引量：2
7
作者 Guangmin Wang Bing Jiang +1 位作者 Kejun Zhu Zhongping Wan 《Journal of Systems Engineering and Electronics》 SCIE EI 2010年第2期239-243,共5页
A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equ... A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm. 展开更多
关键词 bilevel linear fractional-linear programming convex simplex method dual problem.
暂未订购 下载PDF
A Green Mixed Integer Linear Programming Model for Optimization of Byproduct Gases in Iron and Steel Industry 认领 引用 被引量：12
8
作者 Hai-ning KONG 《Journal of Iron and Steel Research International》 SCIE CAS CSCD 2015年第8期681-685,共5页
Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to c... Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to construct an integrated optimized system, taking economics, energy consumption and environment into consideration. Therefore, the environmental cost caused by pollutants discharge should be factored in total cost when optimizing byproduct gas distribution. A green mixed integer linear programming （MILP） model for the optimization of byproduct gases was established to reduce total cost, including both operation cost and environmental cost. The operation cost included penalty for gas deviation, costs of fuel and water consumption, holder booster trip penalty, and so forth; while the environmental cost consisted of penalties for both direct and indirect pollutants discharge. Case study showed that the proposed model brought an optimum solution and 2.2% of the total cost could be reduced compared with previous one. 展开更多
关键词 green mixed integer linear programming environmental cost optimization iron and steel industry byproduct gas
暂未订购 下载PDF
Method for solving fully fuzzy linear programming problems using deviation degree measure 认领 引用 被引量：1
9
作者 Haifang Cheng Weilai Huang Jianhu Cai 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2013年第5期793-799,共7页
A new fully fuzzy linear programming(FFLP)problem with fuzzy equality constraints is discussed.Using deviation degree measures,the FFLP problem is transformed into a crisp 6-parametric linear programming(LP)problem.Gi... A new fully fuzzy linear programming(FFLP)problem with fuzzy equality constraints is discussed.Using deviation degree measures,the FFLP problem is transformed into a crisp 6-parametric linear programming(LP)problem.Giving the value of deviation degree in each constraint,the 6-fuzzy optimal solution of the FFLP problem can be obtained by solving this LP problem.An algorithm is also proposed to find a balance-fuzzy optimal solution between two goals in conflict:to improve the values of the objective function and to decrease the values of the deviation degrees.A numerical example is solved to illustrate the proposed method. 展开更多
关键词 fully fuzzy linear programming(FFLP) fuzzy equality constraint triangular fuzzy number deviation degree.
暂未订购 下载PDF
A non-monotone Phase-1 method in linear programming 认领 引用 被引量：7
10
作者 潘平奇 李炜 《Journal of Southeast University(English Edition)》 EI CAS 2003年第3期293-296,共4页
To gain superior computational efficiency, it might be necessary to change the underlying philosophy of the simplex method. In this paper, we propose a Phase-1 method along this line. We relax not only the conventiona... To gain superior computational efficiency, it might be necessary to change the underlying philosophy of the simplex method. In this paper, we propose a Phase-1 method along this line. We relax not only the conventional condition that some function value increases monotonically, but also the condition that all feasible variables remain feasible after basis change in Phase-1. That is, taking a purely combinatorial approach to achieving feasibility. This enables us to get rid of ratio test in pivoting, reducing computational cost per iteration to a large extent. Numerical results on a group of problems are encouraging. 展开更多
关键词 linear programming Phase-1 ratio-test-free pivoting rule
暂未订购 下载PDF
A New Method for Achieving an Initial Regular Solution of a Linear Programming 认领 引用 被引量：3
11
作者 梁平 孙艳华 +1 位作者 魏德宾 张相斌 《Northeastern Mathematical Journal》 2008年第1期31-34,共4页
A method is provided for finding an initial regular solution of a linear programming in this paper. The key to this method is to solve an auxiliary linear programming instead of to introduce any artificial variable or... A method is provided for finding an initial regular solution of a linear programming in this paper. The key to this method is to solve an auxiliary linear programming instead of to introduce any artificial variable or constraint. Compared with the traditional method of achieving the regular solution by introducing an artificial constraint, it has advantages of saving the memories and little computational efforts. 展开更多
关键词 initial regular solution auxiliary linear programming artificial variable artificial constrain
暂未订购 下载PDF
DEGENERATE OPTIMAL BASIS GRAPHS IN LINEAR PROGRAMMING 认领 引用 被引量：2
12
作者 Lin Yixun\ Wen JianjunDept.of Math.,Zhengzhou Univ.,Zhengzhou450 0 52 . 《Applied Mathematics(A Journal of Chinese Universities)》 2000年第2期184-192,共9页
The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal vertex... The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal vertex x 0. In this paper, several conditions for the characterization of G * are presented. 展开更多
关键词 Linear programming degeneracy transformation graphs.
暂未订购 下载PDF
RIGID-PLASTIC/RIGID-VISCOPLASTIC FEM BASED ON LINEAR PROGRAMMING—THEORETICAL MODELING AND APPLICATION FOR AXISYMMETRICAL PROBLEMS 认领 引用 被引量：1
13
作者 Xu Weili Shi Xiangchen Lin Zhongqin School of Mechanical Engineering,Shanghai Jiaotong University Peter Thomson Di Senglin Australia Monash University Australia University of Technology 《Chinese Journal of Mechanical Engineering》 EI CAS 2001年第2期184-188,共5页
Compared with the traditional rigid plasticigid viscoplastic(RP/RVP) FEM(based on iteration solution),RP/RVP FEM based on linear programming (LP) has some remarkable advantages,such as it's free of convergence pro... Compared with the traditional rigid plasticigid viscoplastic(RP/RVP) FEM(based on iteration solution),RP/RVP FEM based on linear programming (LP) has some remarkable advantages,such as it's free of convergence problem and its convenience in contact,rigid zone,and friction force treatment.The numerical model of RP/RVP FEM based on LP for axisymmetrical metal forming simulation is studied,and some related key factors and its treatment methods in formulation of constraint condition are proposed.Some solution examples are provided to validate its accuracy and efficiency. 展开更多
关键词 Rigid plasticigid viscoplastic FEM Contact treatment Linear programming
暂未订购 下载PDF
Solving Multi-Objective Linear Programming Problem by Statistical Averaging Method with the Help of Fuzzy Programming Method 认领 引用
14
作者 Samsun Nahar Marin Akter Md. Abdul Alim 《American Journal of Operations Research》 2023年第2期19-32,共14页
A multi-objective linear programming problem is made from fuzzy linear programming problem. It is due the fact that it is used fuzzy programming method during the solution. The Multi objective linear programming probl... A multi-objective linear programming problem is made from fuzzy linear programming problem. It is due the fact that it is used fuzzy programming method during the solution. The Multi objective linear programming problem can be converted into the single objective function by various methods as Chandra Sen’s method, weighted sum method, ranking function method, statistical averaging method. In this paper, Chandra Sen’s method and statistical averaging method both are used here for making single objective function from multi-objective function. Two multi-objective programming problems are solved to verify the result. One is numerical example and the other is real life example. Then the problems are solved by ordinary simplex method and fuzzy programming method. It can be seen that fuzzy programming method gives better optimal values than the ordinary simplex method. 展开更多
关键词 Fuzzy Programming Method Fuzzy Linear Programming Problem Multi-Objective Linear Programming Problem Statistical Averaging Method New Statistical Averaging Method
暂未订购 下载PDF
Bilevel linear programming model of charging for effluent based on price control 认领 引用
15
作者 李煜华 李磊 +1 位作者 胡运权 邵海宏 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2007年第2期292-296,共5页
For the optimum price problem of charging for effluent, this paper analyzes the optimal Pigovian Tax and the serious information asymmetry problem existing in the application process of optimal Pigovian Tax, which is ... For the optimum price problem of charging for effluent, this paper analyzes the optimal Pigovian Tax and the serious information asymmetry problem existing in the application process of optimal Pigovian Tax, which is predominant in theory. Then the bilevel system optimizing decision-making theory is applied to give bilevel linear programming decision-making model of charging for effluent, in which the government (environmental protection agency) acts as the upper level decision-making unit and the polluting enterprises act as the lower level decision-making unit. To some extent, the model avoids the serious information asymmetry between the government and the polluting enterprises on charging for effluent. 展开更多
关键词 charging for effluent Pigovian Tax price control bilevel linear programming information asymmetry
暂未订购 下载PDF
Revision of stratified OWL ontologiesbased on integer linear programming 认领 引用
16
作者 Ji Qiu Qi Guilin Boutouhami Khaoula 《Journal of Southeast University(English Edition)》 EI CAS 2020年第1期1-7,共7页
To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-b... To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-based model considers an optimization problem of minimizing a linear objective function which is suitable for selecting the minimal number of axioms to remove when revising ontologies.Based on the incision function,a revision algorithm is proposed to apply ILP to all minimal incoherence-preserving subsets(MIPS).Although this algorithm can often find a minimal number of axioms to remove,it is very time-consuming to compute MIPS.Thus,an adapted revision algorithm to deal with unsatisfiable concepts individually is also given.Experimental results reveal that the proposed ILP-based revision algorithm is much more efficient than the commonly used algorithm based on the hitting set tree.In addition,the adapted algorithm can achieve higher efficiency,while it may delete more axioms. 展开更多
关键词 ontology revision inconsistency handling semantic web integer linear programming
暂未订购 下载PDF
A Linear Programming Model for Seabed Oil-Gas Pipe Network 认领 引用
17
作者 Li, HW Tan, JH 《China Ocean Engineering》 SCIE EI 1998年第4期477-482,共6页
This paper analyzes the pipe network system of oil-gas collection and transportation for offshore oilfield development. A '0-1' integer linear programming model is constructed to optimize the investment of sea... This paper analyzes the pipe network system of oil-gas collection and transportation for offshore oilfield development. A '0-1' integer linear programming model is constructed to optimize the investment of seabed pipe network. The mathematical model is solved by the spanning tree method of graph theory and network analysis. All spanning trees of a network graph compose all the feasible solutions of the mathematical model. The optimal solution of the model is the spanning tree with the minimum cost among all spanning trees. This method can be used to optimize the seabed pipe network system and give a minimum cost plan for the development of offshore marginal oilfield groups. 展开更多
关键词 seabed pipe network offshore oilfield linear programming network analysis
暂未订购 下载PDF
Polynomial Complexity Bounds of Mehrotra-type Predictor-corrector Algorithms for Linear Programming over Symmetric Cones 认领 引用
18
作者 刘长河 尚有林 李振国 《Chinese Quarterly Journal of Mathematics》 2015年第4期475-494,共20页
We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the s... We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O（r log ε1） iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras and ε is the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples. 展开更多
关键词 linear programming symmetric cone Euclidean Jordan algebra interior-point methods Mehrotra-type algorithm polynomial complexity
暂未订购 下载PDF
Support vector classification algorithm based on variable parameter linear programming 认领 引用
19
作者 Xiao Jianhua Lin Jian 《Journal of Systems Engineering and Electronics》 SCIE EI 2007年第2期355-359,共5页
To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed ... To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model. The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given. An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples. 展开更多
关键词 Support vector machine Linear programming Classification Variable parameter.
暂未订购 下载PDF
Application of Gray Linear Programming in Sintering Mixing Calculation 认领 引用
20
作者 Deling Zheng, Zhijiang Zhao, Wei Fang, Tong Fang ( Information Engineering School, University of Science and Technology Beijing, Beijing 100083, China. Tangshan Iron and Steel Group Corp., Tangshan 063000, China Peat Marwick Huazhen CPA Firm, Beijing 10 《International Journal of Minerals,Metallurgy and Materials》 SCIE EI CAS 2000年第4期273-276,共4页
The mixing calculation cannot be restrained by the quantity of return mines. In order to solve this problem, a method that the sintering mixing proportion is optimized by gray linear programming is presented based on ... The mixing calculation cannot be restrained by the quantity of return mines. In order to solve this problem, a method that the sintering mixing proportion is optimized by gray linear programming is presented based on the gray system theory and optimal theory. By using this method, the quality of sintering mines is improved and the energy consumption is reduced. 展开更多
关键词 gray linear programming sintering mixing calculation Metallurgy
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 19 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈