scholarly journals An improved algorithm for non-linear integer programming

1979 ◽  
Vol 5 (2) ◽  
pp. 145-152
Author(s):  
Mary W. Cooper
Keyword(s):  
Integer Programming ◽  
Linear Integer Programming ◽  
Non Linear ◽  
Improved Algorithm

A novel optimal configuration of sensor and actuator using a non-linear integer programming genetic algorithm for active vibration control

2017 ◽  
Vol 28 (15) ◽  
pp. 2074-2081 ◽  
Author(s):  
Chunyou Zhang ◽  
Lihua Wang ◽  
Xiaoqiang Wu ◽  
Weijin Gao
Keyword(s):  
Genetic Algorithm ◽  
Integer Programming ◽  
Vibration Control ◽  
Active Vibration Control ◽  
Flexible Structures ◽  
Linear Quadratic ◽  
Linear Integer Programming ◽  
Optimal Criterion ◽  
Non Linear ◽  
Active Vibration

Due to widespread applications of a large number of flexible structures, to obtain the best dynamic control performance of a system, optimal locations of the actuators and sensors are necessary to be determined. This article proposes a novel optimal criterion for the actuators or sensors ensuring good controllability or observability of a structure, and also considering the remaining modes to control the spillover effect. Based on the proposed optimization criteria, a non-linear integer programming genetic algorithm is employed to achieve the optimal configurations. Active vibration control is investigated for a cantilever plate with the actuators in optimal positions to suppress the specified modes utilizing linear quadratic regulator controller. Several simulation results validate the efficiency and feasibility of the proposed optimal criteria.

scholarly journals Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem

2014 ◽  
Vol 2 (5) ◽  
pp. 451-460 ◽  
Author(s):  
Jianming Zhu
Keyword(s):  
Integer Programming ◽  
Facility Location ◽  
Shortest Path ◽  
Location Problem ◽  
Programming Model ◽  
Maximum Clique ◽  
Facility Location Problem ◽  
Linear Integer Programming ◽  
Non Linear ◽  
The Cost

AbstractIn this paper, a new location analysis method is presented. Given a connected graphG= (V, E)with nonnegative edge costcefor each edgee∊E,dijis the cost of the shortest path between verticesiandjin the graph. TheConnected p-facility Location Problem(CpLP) is to choosepvertices fromVso as to minimize the total cost of shortest path of pair-wise of thesepvertices. This problem is proved to be NP-hard and non-linear integer programming is formulated. Then, two algorithms are designed for solving the CpLP. One is a heuristic algorithm based on classical maximum clique approach, while the second one is genetic algorithm. Finally, computational results show the comparison between these two algorithms.

scholarly journals Finding multiplies solutions for non-linear integer programming

2018 ◽  
Vol 68 ◽  
pp. 125-130 ◽  
Author(s):  
José Manuel Jiménez Cobano ◽  
José María Ucha Enríquez
Keyword(s):  
Integer Programming ◽  
Linear Integer Programming ◽  
Non Linear

scholarly journals Non-linear integer programming

1975 ◽  
Vol 1 (2) ◽  
pp. 215-222 ◽  
Author(s):  
Leon Cooper ◽  
Mary W. Cooper
Keyword(s):  
Integer Programming ◽  
Linear Integer Programming ◽  
Non Linear

Linear Integer Programming

2021 ◽  
Author(s):  
Elias Munapo ◽  
Santosh Kumar
Keyword(s):  
Integer Programming ◽  
Linear Integer Programming

scholarly journals An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets

2020 ◽  
Vol 282 (2) ◽  
pp. 453-463
Author(s):  
María Isabel Hartillo-Hermoso ◽  
Haydee Jiménez-Tafur ◽  
José María Ucha-Enríquez
Keyword(s):  
Integer Programming ◽  
Linear Integer Programming ◽  
Test Sets ◽  
Constraint Method
Sign in / Sign up

Export Citation Format

Share Document