-
101
A Global Optimization Algorithm for Signomial Geometric Programming Problem
Published 2014-01-01“…The proposed algorithm is convergent to the global minimum of the (SGP) by means of the subsequent solutions of a series of relaxation linear programming problems. And finally, the numerical results are reported to vindicate the feasibility and effectiveness of the proposed method.…”
Get full text
Article -
102
A Novel Approach for Portfolio Optimization Using Fuzzy AHP Based on Gustafson Kessel Clustering Algorithm
Published 2024-12-01“…By using new fuzzy numbers, the weights of the criteria were obtained as TrFNs. Then, a linear programming problem was modeled using the weights of the obtained criteria as a TrFN. …”
Get full text
Article -
103
A Multi-Objective Approach to Portfolio Optimization Problem Using the Analytic Hierarchy Process (AHP) and Genetic Algorithm
Published 2022-03-01“…Accordingly, a novel model is designed as linear programming in order to optimize the investment portfolio, considering the expected rate of return, the minimum risk, and the buyer’s assets. …”
Get full text
Article -
104
Dynamic Network Design Problem under Demand Uncertainty: An Adjustable Robust Optimization Approach
Published 2014-01-01“…In particular, a cell transmission model based network design problem of linear programming type is considered to describe dynamic traffic flows, and a polyhedral uncertainty set is used to characterize the demand uncertainty. …”
Get full text
Article -
105
A Hybrid Evolutionary Algorithm for Wheat Blending Problem
Published 2014-01-01“…After that, a hybrid of an evolutionary algorithm, a heuristic method, and a linear programming solver is used to improve the quality of the solution. …”
Get full text
Article -
106
Generalized Heptagonal Membership Function for Fully Fuzzy Linear Fractional Programming Problems
Published 2025-01-01“…Several approaches, including linear programming, nonlinear programming, genetic algorithms, and computational intelligence algorithms, have been suggested to handle fully fuzzy fractional linear programming (FFFL) problems. …”
Get full text
Article -
107
Regional consensus of switched positive multi-agent systems with multiple equilibria
Published 2025-01-01“…The regional consensus protocol is designed in the form of linear programming. By employing the proposed protocol, all states of agents are nonnegative and driven into a specific region. …”
Get full text
Article -
108
Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty
Published 2024-09-01“…Given a compact linear programming formulation for the nominal problem, we provide a mixed-integer linear programming (MILP) formulation for DDID. …”
Get full text
Article -
109
Maximizing the lifetime of wireless sensor networks in trains for monitoring long-distance goods transportation
Published 2017-05-01“…We first formulate the problem with a realistic discrete power model as a mixed integer linear programming problem. Then, a two-step efficient deployment heuristic is proposed to satisfy these constraints step by step. …”
Get full text
Article -
110
Locating Routing Problem (LRP) of distribution of priority support items to ground forces in war conditions
Published 2024-08-01“…Additionally, a mixed-integer linear programming model is proposed for routing prioritized support items. …”
Get full text
Article -
111
Comparison of the ellipsoid and simplex methods
Published 1999-12-01“…The Klee-Minty linear programming problem is used to compare the ellipsoid and simplex methods. …”
Get full text
Article -
112
Optimal selection of the nutritive value
Published 1998-12-01“…The metodology includes a formal problem statement, interactive selection of parameters of the optimized function and application of the algorithms of non-linear programming. The method enables us to get the optimal values of the objective function argument with the best parameters of the function, according to the planners. …”
Get full text
Article -
113
Geographic based maximum lifetime routing in data aggregated wireless sensor networks with multiple base stations
Published 2010-01-01“…Network lifetime maximization in data-aggregated wireless sensor networks with multiple base stations by using geographic routing scheme was studied.To reduce the transmission overhead and avoid routing loops,home base station set potential descendent(HBSPD) algorithm was proposed,and linear programming method was used to optimize the network lifetime.Geographic location based multiple base station tessellation(GLMBST) algorithm was presented,and subgradient method was adopted to design the distributed algorithm.Performances of the proposed algorithms were verified by simulation experiments.…”
Get full text
Article -
114
Optimization of fractional composition of the excipient in the elastomeric covering for asphalt highways
Published 2013-03-01“…The computational method of optimum fractional composition of a dispersible filler of polymeric composite on the basis of three-dimensionally linked elastomer is developed according to non-linear programming. The coefficient of dynamic viscosity of polymeric suspension or the initial module of a viscoelasticity of the join solidification low-molecular rubbers with the final functional groups, filled by many fractional dioxide of silicon are considered as criteria of optimization. …”
Get full text
Article -
115
Research and design of authenticated encryption algorithm based on AES round function
Published 2020-04-01“…The authenticated encryption algorithm guarantees the confidentiality and integrity of the information at the same time,and has extensive research and application prospects in the field of information security.With the mixed integer linear programming (MILP) method,the iterative structure with high efficiency and more active S boxes is searched.Based on this new round iterative function and the generalized Feistel structure,an authenticated encryption algorithm with the ability to resist collision attack,differential attack,linear attack and other attacks was designed and implemented,and the efficiency was twice that of AES-GCM.…”
Get full text
Article -
116
Analysis and Design of Robust Positivity and Stability for Continuous-Time Linear Uncertain Systems
Published 2015-01-01“…Second, the state-feedback stabilization problem is solved by using linear programming (LP). Numerical examples are given for illustration. …”
Get full text
Article -
117
A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks
Published 2014-02-01“…We verify by computational experiments that the proposed B&B algorithm is more efficient, in terms of computation time, than the integer linear programming model developed by Rebai et al. (2013), for the same problem.…”
Get full text
Article -
118
Collaborative task offloading and resource allocation optimization for intelligent edge devices
Published 2022-12-01“…In order to deal with the increasingly scarce computing resources, a cooperative edge computing scheme was proposed, which makes full use of the idle resources among users to improve the overall data processing performance.To maximize the user utility, the target problem was formulated as an MINLP (mixed integer non-linear programming), and a learning-optimization-integrated method was proposed to jointly optimize the resource allocation and user offloading decisions.Simulation results show that the proposed scheme can produce a near-optimal solution in sub-second and effectively improve the system utility at least 85.4% compared to the considered benchmark methods.…”
Get full text
Article -
119
A Bilevel Multiobjective Optimisation Approach for Solving the Evacuation Location Assignment Problem
Published 2019-01-01“…Next, the problem is linearised into a mixed-integer linear programming model and solved using an off-the-shelf solver. …”
Get full text
Article -
120
Positive Filtering with l1-Gain for Discrete-Time Positive Systems
Published 2016-01-01“…Then, necessary and sufficient conditions for the existence of required filters are presented, and the obtained results are expressed as linear programming problems. Moreover, it is pointed out that the results can be easily checked by standard software. …”
Get full text
Article