scholarly journals Bidirectional branch and bound for controlled variable selection. Part II: Exact local method for self-optimizing control

2009 ◽  
Vol 33 (8) ◽  
pp. 1402-1412 ◽  
Author(s):  
Vinay Kariwala ◽  
Yi Cao
Keyword(s):  
Variable Selection ◽  
Branch And Bound ◽  
Local Method ◽  
Optimizing Control

scholarly journals An intelligent approach of controlled variable selection for constrained process self-optimizing control

2022 ◽  
Vol 10 (1) ◽  
pp. 65-72
Author(s):  
Hongxin Su ◽  
Chenchen Zhou ◽  
Yi Cao ◽  
Shuang-Hua Yang ◽  
Zuzhen Ji
Keyword(s):  
Variable Selection ◽  
Selection For ◽  
Optimizing Control ◽  
Intelligent Approach

MIQP formulation for Controlled Variable Selection in Self Optimizing Control

2010 ◽  
Vol 43 (5) ◽  
pp. 61-66 ◽  
Author(s):  
Ramprasad Yelchuru ◽  
Sigurd Skogestad ◽  
Henrik Manum
Keyword(s):  
Variable Selection ◽  
Optimizing Control

Optimal Network Problem: A Branch-and-Bound Algorithm

1973 ◽  
Vol 5 (4) ◽  
pp. 519-533 ◽  
Author(s):  
D E Boyce ◽  
A Farhi ◽  
R Weischedel
Keyword(s):  
Variable Selection ◽  
Branch And Bound ◽  
Shortest Path ◽  
Budget Constraint ◽  
Computational Experience ◽  
Branch And Bound Algorithm ◽  
Selection Problems ◽  
Network Problem ◽  
Optimal Network ◽  
Modified Algorithm

The problem of selecting a subset of links so as to minimize the sum of shortest path distances between all pairs of nodes, subject to a budget constraint on total length of links, may be solved by a modification of a branch-and-bound algorithm developed for optimal variable selection problems in statistics. The modified algorithm is described in detail, and encouraging computational experience on 10 node networks is reported. The use of the algorithm as a heuristic approach to solving the optimal network problem is also discussed.

Sign in / Sign up

Export Citation Format

Share Document