期刊文献+
共找到293篇文章
< 1 2 15 >
每页显示 20 50 100
Predicting the minimum horizontal principal stress using genetic expression programming and borehole breakout data
1
作者 Rui Zhang Jian Zhou 《Journal of Rock Mechanics and Geotechnical Engineering》 2025年第7期4227-4240,共14页
As a critical component of the in situ stress state,determination of the minimum horizontal principal stress plays a significant role in both geotechnical and petroleum engineering.To this end,a gene expression progra... As a critical component of the in situ stress state,determination of the minimum horizontal principal stress plays a significant role in both geotechnical and petroleum engineering.To this end,a gene expression programming(GEP)algorithm-based model,in which the data of borehole breakout size,vertical principal stress,and rock strength characteristics are used as the inputs,is proposed to predict the minimum horizontal principal stress.Seventy-nine(79)samples with seven features are collected to construct the minimum horizontal principal stress dataset used for training models.Twenty-four(24)GEP model hyperparameter sets were configured to explore the key parameter combinations among the inputs and their potential relationships with the minimum horizontal principal stresses.Model performance was evaluated using root mean squared error(RMSE),mean absolute error(MAE),mean absolute percentage error(MAPE),and coefficient of determination(R^(2)).By comparing predictive performance and parameter composition,two models were selected from 24 GEP models that demonstrated excellent predictive performance and simpler parameter composition.Compared with prevalent models,the results indicate that the two selected GEP models have better performance on the test set(R^(2)=0.9568 and 0.9621).Additionally,the results conducted by SHapley Additive exPlanations(SHAP)sensitivity analysis and Local Interpretable Model-agnostic Explanations(LIME)demonstrate that the vertical principal stress is the most influential parameter in both GEP models.The two GEP models have simple parameter compositions as well as stable and excellent prediction performance,which is a viable method for predicting the minimum horizontal principal stresses. 展开更多
关键词 Gene expression programming(GEP) In situ stresses minimum horizontal principal stresses Borehole breakout
在线阅读 下载PDF
THE APPLICATION OF THE BRANCH AND BOUND METHOD FOR DETERMINING THE MINIMUM FLOW OF A TRANSPORT NETWORK
2
作者 宁宣熙 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 1996年第2期45+41-44,共5页
Blockage is a kind of phenomenon frequently occurred in a transport network, in which the human beings are the moving subjects. The minimum flow of a network defined in this paper means the maximum flow quantity throu... Blockage is a kind of phenomenon frequently occurred in a transport network, in which the human beings are the moving subjects. The minimum flow of a network defined in this paper means the maximum flow quantity through the network in the seriously blocked situation. It is an important parameter in designing and operating a transport network, especially in an emergency evacuation network. A branch and bound method is presented to solve the minimum flow problem on the basis of the blocking flow theory and the algorithm and its application are illustrated by examples. 展开更多
关键词 network flow graph theory network programming minimum flow blocking flow
在线阅读 下载PDF
Attractor-Based Simultaneous Design of the Minimum Set of Control Nodes and Controllers in Boolean Networks
3
作者 Koichi Kobayashi 《Applied Mathematics》 2016年第14期1510-1520,共11页
Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a contr... Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a controller is studied. A control node corresponds to a gene that expression can be controlled. Here, a Boolean network is used as a model of gene regulatory networks, and control specifications on attractors, which represent cell types or states of cells, are imposed. It is important to design a gene regulatory network that has desired attractors and has no undesired attractors. Using a matrix-based representation of BNs, this problem can be rewritten as an integer linear programming problem. Finally, the proposed method is demonstrated by a numerical example on a WNT5A network, which is related to melanoma. 展开更多
关键词 Boolean Networks Integer Linear programming minimum Set of Control Nodes Singleton Attractors
在线阅读 下载PDF
Decomposition of Mathematical Programming Models for Aircraft Wing Design Facilitating the Use of Dynamic Programming Approach
4
作者 Prashant K. Tarun Herbert W. Corley 《American Journal of Operations Research》 2023年第5期111-131,共21页
Aircraft designers strive to achieve optimal weight-reliability tradeoffs while designing an aircraft. Since aircraft wing skins account for more than fifty percent of their structural weight, aircraft wings must be d... Aircraft designers strive to achieve optimal weight-reliability tradeoffs while designing an aircraft. Since aircraft wing skins account for more than fifty percent of their structural weight, aircraft wings must be designed with utmost care and attention in terms of material types and thickness configurations. In particular, the selection of thickness at each location of the aircraft wing skin is the most consequential task for aircraft designers. To accomplish this, we present discrete mathematical programming models to obtain optimal thicknesses either to minimize weight or to maximize reliability. We present theoretical results for the decomposition of these discrete mathematical programming models to reduce computer memory requirements and facilitate the use of dynamic programming for design purposes. In particular, a decomposed version of the weight minimization problem is solved for an aircraft wing with thirty locations (or panels) and fourteen thickness choices for each location to yield an optimal minimum weight design. 展开更多
关键词 Aircraft Wing Design Maximum Reliability Design minimum Weight Design Dynamic programming OPTIMIZATION DECOMPOSITION
在线阅读 下载PDF
A Dynamic Programming Approach to the Design of Composite Aircraft Wings
5
作者 Prashant K. Tarun Herbert W. Corley 《American Journal of Operations Research》 2022年第5期194-207,共14页
A light and reliable aircraft has been the major goal of aircraft designers. It is imperative to design the aircraft wing skins as efficiently as possible since the wing skins comprise more than fifty percent of the s... A light and reliable aircraft has been the major goal of aircraft designers. It is imperative to design the aircraft wing skins as efficiently as possible since the wing skins comprise more than fifty percent of the structural weight of the aircraft wing. The aircraft wing skin consists of many different types of material and thickness configurations at various locations. Selecting a thickness for each location is perhaps the most significant design task. In this paper, we formulate discrete mathematical programming models to determine the optimal thicknesses for three different criteria: maximize reliability, minimize weight, and achieve a trade-off between maximizing reliability and minimizing weight. These three model formulations are generalized discrete resource-allocation problems, which lend themselves well to the dynamic programming approach. Consequently, we use the dynamic programming method to solve these model formulations. To illustrate our approach, an example is solved in which dynamic programming yields a minimum weight design as well as a trade-off curve for weight versus reliability for an aircraft wing with thirty locations (or panels) and fourteen thickness choices for each location. 展开更多
关键词 Aircraft Wing Design Maximum Reliability Design minimum Weight Design Dynamic programming Multiple Objective Optimization Pareto Optimality
在线阅读 下载PDF
Mathematical Model and Simulation of Harmful Invasive Plant Control
6
作者 马庆功 杨波 《Agricultural Science & Technology》 CAS 2014年第12期2057-2063,共7页
Plant invasion refers to the phenomenon that some plants grow too fast due to they are far away from the original living environment or predators, affecting the local environment. With the development of tourism and t... Plant invasion refers to the phenomenon that some plants grow too fast due to they are far away from the original living environment or predators, affecting the local environment. With the development of tourism and trade, the harm caused by invasive plants will be more and more serious. Therefore, it is necessary to ex- plore an effective method for controlling plant invasion through qualitative and quan- titative research. In this paper, the models were established for the early and late harmful plant invasion control. The huge computation was completed by the com- puter programming to obtain the optimal solutions of the models. The real meaning of the optimal solution was further discussed. Through numerical simulations and discussion, it could be concluded that the quantitative research on the invasive plant control had a certain application value. 展开更多
关键词 Invasive plant Linear programming model Logistic model Pontryagin minimum principle Numerical simulation
在线阅读 下载PDF
A Novel Method for the Application of the ECMS(Equivalent Consumption Minimization Strategy)to Reduce Hydrogen Consumption in Fuel Cell Hybrid Electric Vehicles 被引量:2
7
作者 Wen Sun Hao Liu +3 位作者 Ming Han Ke Sun Shuzhan Bai Guoxiang Li 《Fluid Dynamics & Materials Processing》 EI 2022年第4期867-882,共16页
Fuel cell hybrid electric vehicles are currently being considered as ideal means to solve the energy crisis and global warming in today’s society.In this context,this paper proposes a method to solve the problem rela... Fuel cell hybrid electric vehicles are currently being considered as ideal means to solve the energy crisis and global warming in today’s society.In this context,this paper proposes a method to solve the problem related to the dependence of the so-called optimal equivalent factor(determined in the framework of the equivalent consumption minimum strategy-ECMS)on the working conditions.The simulation results show that under typical conditions(some representative cities being considered),the proposed strategy can maintain the power balance;for different initial battery’s states of charge(SOC),after the SOC stabilizes,the fuel consumption is 5.25 L/100 km. 展开更多
关键词 Energy management fuel cell hybrid electric vehicle dynamic programming adaptive equivalent consumption minimum strategy
在线阅读 下载PDF
A Weighted Goal Programming Model for the DASH Diet Problem: Comparison with the Linear Programming DASH Diet Model
8
作者 Anayo Charles Iwuji Emeka Uchendu Agwu 《American Journal of Operations Research》 2017年第5期307-322,共16页
A Linear Programming DASH diet model for persons with hypertension has previously been formulated and daily minimum cost diet plans that satisfy the DASH diets’ tolerable intake level of the nutrients for 1500 mg a d... A Linear Programming DASH diet model for persons with hypertension has previously been formulated and daily minimum cost diet plans that satisfy the DASH diets’ tolerable intake level of the nutrients for 1500 mg a day Sodium level and different daily calorie levels were obtained using sample foods from the DASH diet eating plan chart. But the limitation in the use of linear programming model in selecting diet plans to meet specific nutritional requirements which normally results in the oversupply of certain nutrients was evident in the linear programming DASH diet plan obtained as the nutrient level of the diet plans obtained had wide deviations of from the DASH diets’ tolerable upper and lower intake level for the given calorie and sodium levels. Hence the need for a model that gives diet plans with minimized nutrients’ level deviations from the DASH diets’ tolerable intake level for different daily calorie and sodium level at desired cost. A weighted Goal Programming DASH diet model that minimizes the daily cost of the DASH eating plan as well as deviations of the diets’ nutrients content from the DASH diet’s tolerable intake levels is hereby presented in this work. The formulated weighted goal programming DASH diet model is further illustrated using chosen sample foods from the DASH food chart as used in the work on the linear programming DASH diet model for a 1500 mg sodium level and 2000 calories a day diet plan as well as for 1800, 2200, 2400, 2600, 2800 and 3000 daily calorie levels. A comparison of the DASH nutrients’ composition of the weighted Goal Programming DASH diet plans and those of the linear programming DASH diet plans were carried out at this sodium level and the different daily calorie levels. It was evident from the results of the comparison that the weighted goal programming DASH diet plans has minimized deviations from the DASH diet’s tolerable intake levels than those of the linear programming DASH diet plans. 展开更多
关键词 DASH (Dietary Approaches to Stop Hypertension) DIET MODEL HYPERTENSION DIET MODEL minimum Nutrient Deviation DIET Plan WEIGHTED GOAL programMING DIET MODEL Linear and GOAL programMING Comparison
暂未订购
Minimum Dwell Time for Global Exponential Stability of a Class of Switched Positive Nonlinear Systems 被引量:4
9
作者 Ruicheng Ma Shuang An 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2019年第2期471-477,共7页
This paper will investigate global exponential stability analysis for a class of switched positive nonlinear systems under minimum dwell time switching, whose nonlinear functions for each subsystem are constrained in ... This paper will investigate global exponential stability analysis for a class of switched positive nonlinear systems under minimum dwell time switching, whose nonlinear functions for each subsystem are constrained in a sector field by two odd symmetric piecewise linear functions and whose system matrices for each subsystem are Metzler. A class of multiple time-varying Lyapunov functions is constructed to obtain the computable sufficient conditions on the stability of such switched nonlinear systems within the framework of minimum dwell time switching.All present conditions can be solved by linear/nonlinear programming techniques. An example is provided to demonstrate the effectiveness of the proposed result. 展开更多
关键词 EXPONENTIAL stability linear/nonlinear programMING minimum DWELL time SWITCHED NONLINEAR systems
在线阅读 下载PDF
Shape Optimization of Bow Bulbs with Minimum Wave-Making Resistance Based on Rankine Source Method 被引量:5
10
作者 张宝吉 《Journal of Shanghai Jiaotong university(Science)》 EI 2012年第1期65-69,共5页
The hull form optimization concerns one of the most important applications of wave-making resistance theories.In recent years,scholars can determine the hull form by using the optimization method based on the computat... The hull form optimization concerns one of the most important applications of wave-making resistance theories.In recent years,scholars can determine the hull form by using the optimization method based on the computational fluid dynamics(CFD)and other mathematical techniques.In this paper,the hull form optimization method based on the Rankine source method and nonlinear programming(NLP)is discussed;in the optimization process,a hull form modification function is introduced to represent an improved hull surface and to generate a new smooth hull surface by changing its frame lines and bow stem profiles under the prescribed design constraints. Numerical example is given for a practical container hull form.Finally,shape optimization of bow bulls is shown for non-protruding and protruding bow bulls.This study presents a simplified and practical design method to the select frame lines of bow bulls. 展开更多
关键词 shape optimization minimum wave-making resistance Rankine source method nonlinear programming(NLP)
原文传递
A Complex Algorithm for Solving a Kind of Stochastic Programming
11
作者 Yunpeng Luo Xinshun Ma 《Journal of Applied Mathematics and Physics》 2020年第6期1016-1030,共15页
Considering that the probability distribution of random variables in stochastic programming usually has incomplete information due to a perfect sample data in many real applications, this paper discusses a class of tw... Considering that the probability distribution of random variables in stochastic programming usually has incomplete information due to a perfect sample data in many real applications, this paper discusses a class of two-stage stochastic programming problems modeling with maximum minimum expectation compensation criterion (MaxEMin) under the probability distribution having linear partial information (LPI). In view of the nondifferentiability of this kind of stochastic programming modeling, an improved complex algorithm is designed and analyzed. This algorithm can effectively solve the nondifferentiable stochastic programming problem under LPI through the variable polyhedron iteration. The calculation and discussion of numerical examples show the effectiveness of the proposed algorithm. 展开更多
关键词 Stochastic programming with Recourse Probability Distribution with Linear Partial Information Maximized minimum Expectation Complex Algorithm
在线阅读 下载PDF
Minimum Living Cost Program in Zhejiang
12
作者 CHEN SHENGYONG & MA BIN 《The Journal of Human Rights》 2002年第4期28-29,共2页
The promulgation of the Rules represents a crucial step toward institutionalization and standardization of the minimum cost of living program, which marks the end of the arbitrariness in the traditional relief behavio... The promulgation of the Rules represents a crucial step toward institutionalization and standardization of the minimum cost of living program, which marks the end of the arbitrariness in the traditional relief behavior. In a country, to what degree the citizens enjoy human rights, it depends on the law. The minimum cost of living system has to be ensured by law in its progress toward institutionalization and standardization. This has been testified by the history of the development of the social security systems, either in Germany, which is regarded as a pioneer in modern social security systems or the United States. 展开更多
关键词 minimum Living Cost program in Zhejiang
原文传递
基于CCP的ECU在线编程技术的实现 被引量:11
13
作者 蒋建春 陈洪霞 郑太雄 《计算机工程》 CAS CSCD 北大核心 2011年第5期241-243,共3页
针对车身ECU升级困难的现状,在分析IAP技术的基础上,提出一种基于CAN总线,采用CCP协议实现ECU在线升级的设计方案,并给出在单片机XC167CI的具体实现。阐述上位机文件下载工具中对加载文件的处理方法和下位机bootloader的实现方法。实验... 针对车身ECU升级困难的现状,在分析IAP技术的基础上,提出一种基于CAN总线,采用CCP协议实现ECU在线升级的设计方案,并给出在单片机XC167CI的具体实现。阐述上位机文件下载工具中对加载文件的处理方法和下位机bootloader的实现方法。实验结果表明,该系统可以通过CAN总线实现ECU的应用代码的更新功能,且操作简单、运行稳定。 展开更多
关键词 升级 在应用编程 CAN标定协议
在线阅读 下载PDF
基于CCP和多智能体优化算法的微电网经济运行 被引量:2
14
作者 张晓芳 《自动化仪表》 CAS 2017年第7期20-23,28,共5页
随着社会的发展,电力系统正在从传统的集中式结构网络向分布式结构的智能电网转变。分布式电源(DG)并网对于分布式结构的微电网调度尤其重要。为了使微电网在安全可靠供电的同时经济运行,采用机会约束规则(CCP)和DG多智能体一致性原则,... 随着社会的发展,电力系统正在从传统的集中式结构网络向分布式结构的智能电网转变。分布式电源(DG)并网对于分布式结构的微电网调度尤其重要。为了使微电网在安全可靠供电的同时经济运行,采用机会约束规则(CCP)和DG多智能体一致性原则,建立了微网经济优化模型。考虑到风电、光伏发电系统存在很强的随机性,在求解时采用随机模拟技术。选择一个主DG来控制增量成本,并将DG增量成本作为一致性变量;采用基于随机模拟技术的粒子群算法(PSO),求解包含随机变量的规划问题。对微网5个光伏DG的仿真验证结果表明:在不同负荷下,采用该模型进行优化计算,达到增量成本一致的效果,符合供需平衡。仿真结果验证了该模型能够满足微网经济运行的需求。 展开更多
关键词 电力系统 微电网 智能电网 分布式电源 机会约束规则 PSO算法
在线阅读 下载PDF
青梅汁啤酒生产中CCP难点分析与有效实施探讨 被引量:1
15
作者 王丽华 高文成 王旭亮 《现代食品》 2019年第13期82-88,共7页
青梅汁啤酒是都市消费新时尚,其安全问题是大众关注的焦点,对青梅汁啤酒生产过程进行品质安全管控并建立体系十分必要,通过对食品安全管理体系中CCP点和HACCP计划的分析,确立了青梅汁啤酒生产过程中原料验收(包括麦芽、大米、青梅汁及... 青梅汁啤酒是都市消费新时尚,其安全问题是大众关注的焦点,对青梅汁啤酒生产过程进行品质安全管控并建立体系十分必要,通过对食品安全管理体系中CCP点和HACCP计划的分析,确立了青梅汁啤酒生产过程中原料验收(包括麦芽、大米、青梅汁及啤酒瓶)、发酵、杀菌和成品检验4个关键控制点,同时制定出对应的关键限值,可以有效控制和提升产品品质与安全管理水平,预防食品风险的发生。 展开更多
关键词 青梅汁啤酒 ccp关键点 危害 HAccp计划
在线阅读 下载PDF
Positioning method of a cylindrical cutter for ruled surface machining based on minimizing one-sided Hausdorff distance 被引量:3
16
作者 Cao Lixin Dong Lei 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2015年第5期1564-1573,共10页
Motivated by the definition of the machining errors induced by tool path planning methods, a mapping curve of the tool axis of a cylindrical cutter is constructed on the tool surface. The mapping curve is a typical on... Motivated by the definition of the machining errors induced by tool path planning methods, a mapping curve of the tool axis of a cylindrical cutter is constructed on the tool surface. The mapping curve is a typical one that can be used to express the closeness between the tool surface and the surface to be machined. A novel tool path planning method is proposed for flank or plunge milling ruled surfaces based on the minimization of the one-sided Hausdorff distance (HD) from the mapping curve to the surface to be machined. It is a nonlinear optimization problem in best uniform approximation (BUA) or Chebyshev sense. A mathematical programming model for computing the minimum one-sided HD is proposed. The linearization method of the programming model is provided and the final optimal solutions are obtained by simplex method. The effectiveness of the proposed BUA method is verified by two numerical examples and compared with the least squares (LS) and double point offset (DPO) methods. The variation in tool orientation induced by the optimization of the tool positions is also evaluated. 展开更多
关键词 Geometrical error Mapping curve Mathematical programming minimum Hausdorff dis-tance Ruled surface Tool path planning
原文传递
Time resource management of OAR based on fuzzy logic priority for multiple target tracking 被引量:5
17
作者 HAN Qinghua PAN Minghai +1 位作者 ZHANG Wucai LIANG Zhiheng 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第4期742-755,共14页
For coping with the multiple target tracking in the presence of complex time-varying environments and unknown target information, a time resource management scheme based on chance-constraint programming(CCP) employi... For coping with the multiple target tracking in the presence of complex time-varying environments and unknown target information, a time resource management scheme based on chance-constraint programming(CCP) employing fuzzy logic priority is proposed for opportunistic array radar(OAR). In this scheme,the total beam illuminating time is minimized by effective time resource allocation so that the desired tracking performance is achieved. Meanwhile, owing to the randomness of radar cross section(RCS), the CCP is used to balance tracking accuracy and time resource conditioned on the specified confidence level. The adaptive fuzzy logic prioritization, imitating the human decision-making process for ranking radar targets, can realize the full potential of radar. The Bayesian Crame ′r-Rao lower bound(BCRLB) provides us with a low bound of localization estimation root-mean-square error(RMSE), and equally important, it can be calculated predictively. Consequently, it is employed as an optimization criterion for the time resource allocation scheme. The stochastic simulation is integrated into the genetic algorithm(GA) to compose a hybrid intelligent optimization algorithm to solve the CCP optimization problem. The simulation results show that the time resource is saved strikingly and the radar performance is also improved. 展开更多
关键词 chance-constraint programming ccp fuzzy logicpriority opportunistic array radar (OAR) root-mean-square error(RMSE) Bayesian Cram6r-Rao lower bound (BCRLB)
在线阅读 下载PDF
Dynamic programming methodology for multi-criteria group decision-making under ordinal preferences 被引量:3
18
作者 Wu Li Guanqi Guo +1 位作者 Chaoyuan Yue Yong Zhao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第6期975-980,共6页
A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the ... A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the criteria are considered. Similarly, the total inconsistency between their final rankings for the group and the ones under every criteria is determined after the criteria weights are taken into account. Then two nonlinear integer programming models minimizing respectively the two total inconsistencies above are developed and then transformed to two dynamic programming models to obtain separately the rankings of all alternatives for the group with respect to each criteria and their final rankings. A supplier selection case illustrated the proposed method, and some discussions on the results verified its effectiveness. This work develops a new measurement of ordinal preferences’ inconsistency in multi-criteria group decision-making (MCGDM) and extends the cook-seiford social selection function to MCGDM considering weights of criteria and decision makers and can obtain unique ranking result. 展开更多
关键词 multi-criteria group decision-making (MCGDM) ordinal preference minimum deviation method dynamic programming Cook-Seiford social selection function.
在线阅读 下载PDF
Sequential quadratic programming-based non-cooperative target distributed hybrid processing optimization method 被引量:3
19
作者 SONG Xiaocheng WANG Jiangtao +3 位作者 WANG Jun SUN Liang FENG Yanghe LI Zhi 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2023年第1期129-140,共12页
The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense ... The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense anti-missile targets defense problem is abstracted as a nonconvex constrained combinatorial optimization problem with the optimization objective of maximizing the degree of contribution of the processing scheme to non-cooperative targets, and the constraints mainly consider geographical conditions and anti-missile equipment resources. The grid discretization concept is used to partition the defense area into network nodes, and the overall defense strategy scheme is described as a nonlinear programming problem to solve the minimum defense cost within the maximum defense capability of the defense system network. In the solution of the minimum defense cost problem, the processing scheme, equipment coverage capability, constraints and node cost requirements are characterized, then a nonlinear mathematical model of the non-cooperative target distributed hybrid processing optimization problem is established, and a local optimal solution based on the sequential quadratic programming algorithm is constructed, and the optimal firepower processing scheme is given by using the sequential quadratic programming method containing non-convex quadratic equations and inequality constraints. Finally, the effectiveness of the proposed method is verified by simulation examples. 展开更多
关键词 non-cooperative target distributed hybrid processing multiple constraint minimum defense cost sequential quadratic programming
在线阅读 下载PDF
Shape-sizing nested optimization of deployable structures using SQP 被引量:1
20
作者 戴璐 关富玲 《Journal of Central South University》 SCIE EI CAS 2014年第7期2915-2920,共6页
The potential role of formal structural optimization was investigated for designing foldable and deployable structures in this work.Shape-sizing nested optimization is a challenging design problem.Shape,represented by... The potential role of formal structural optimization was investigated for designing foldable and deployable structures in this work.Shape-sizing nested optimization is a challenging design problem.Shape,represented by the lengths and relative angles of elements,is critical to achieving smooth deployment to a desired span,while the section profiles of each element must satisfy structural dynamic performances in each deploying state.Dynamic characteristics of deployable structures in the initial state,the final state and also the middle deploying states are all crucial to the structural dynamic performances.The shape was represented by the nodal coordinates and the profiles of cross sections were represented by the diameters and thicknesses.SQP(sequential quadratic programming) method was used to explore the design space and identify the minimum mass solutions that satisfy kinematic and structural dynamic constraints.The optimization model and methodology were tested on the case-study of a deployable pantograph.This strategy can be easily extended to design a wide range of deployable structures,including deployable antenna structures,foldable solar sails,expandable bridges and retractable gymnasium roofs. 展开更多
关键词 deployable structures OPTIMIZATION minimum mass dynamic constraints SQP(sequential quadratic programming) algorithm
在线阅读 下载PDF
上一页 1 2 15 下一页 到第
使用帮助 返回顶部