1983
DOI: 10.1080/00207178308932994
|View full text |Cite
|
Sign up to set email alerts
|

A linear programming approach for multivariable feedback control with inequality constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0
1

Year Published

1991
1991
2016
2016

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 58 publications
(14 citation statements)
references
References 8 publications
0
13
0
1
Order By: Relevance
“…For example, Zadeh and Whalen [9] and Propoi [10] introduce the approaches to solve MPC problem based on linear programming in the early sixties. And some other authors published their investigation concerning the linear programming based MPC [11]- [14].…”
Section: B Linear Programming Formulationmentioning
confidence: 99%
“…For example, Zadeh and Whalen [9] and Propoi [10] introduce the approaches to solve MPC problem based on linear programming in the early sixties. And some other authors published their investigation concerning the linear programming based MPC [11]- [14].…”
Section: B Linear Programming Formulationmentioning
confidence: 99%
“…Define Xsp to contain a sequence of set-points for the outputs up to the time horizon, so that the open-loop error may be calculated in advance as XOL -XSP. Then the ideal control sequence Lim will be the one which minimises the magnitudes of the elements of the residual r =xoL-xsp+BLim Transforming and adding a term for move suppression (Morshedi et ai, 1985), we minimise rather the magnitude of Minimisation of the size of each term in p , yet keeping Lim, m and XCL within defined upper and lower constraints, is achieved using the linear programming technique of Chang and Seborg (1983).…”
Section: Control Algorithmmentioning
confidence: 99%
“…Both control actions will affect the entire concentration profile, so some minimisation of future deviations from setpoint over a time horizon is essential. A constrained multivariable Linear Dynamic Matrix Controller (LDMC), based on the linear programming solution of Chang and Seborg (1983), and the formulation ofMorshedi et at (1985), has been formulated as follows:…”
Section: Control Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…This MPC approach is also applied in general resource allocation or scheduling problems as done in Ferrari-Trecate et al (2004), Lee et al (2007), Lee and Lee (2006), Munawar and Gudi (2005), van Staden, Zhang, andZafra-Cabeza et al (2008) MPC algorithm needs to solve an optimization problem in each iteration. Studies on the connections of MPC with optimization were conducted since the 1960's (see Chang and Seborg (1983) and Zadeh and Whalen (1962)). Modern MPC approaches for resource allocation problems do not take the relationship of the MPC solutions and the global optimal resource allocation solutions into consideration.…”
Section: Introductionmentioning
confidence: 99%