# Difference between revisions of "FAQ: Are there rigorous ways of determining if it's impossible to meet certain/multiple performance specifications?"

From FBSwiki

(updated author) |
|||

Line 4: | Line 4: | ||

On the other hand, if your specifications consist of a number of equalities or inequalities over some vector space (e.g. of states, inputs, frequency response or some combination thereof), it's reasonable to pose the problem of determining the region (maybe null) in the vector space that is the intersection of these constraints. | On the other hand, if your specifications consist of a number of equalities or inequalities over some vector space (e.g. of states, inputs, frequency response or some combination thereof), it's reasonable to pose the problem of determining the region (maybe null) in the vector space that is the intersection of these constraints. | ||

[[Category: Frequently Asked Questions]] | [[Category: Frequently Asked Questions]] | ||

− | [[Category: Robust Performance | + | [[Category: Robust Performance FAQ]] |

## Latest revision as of 16:50, 17 May 2008

*Posted by Lars Cremean, 20 November 2002*

In short, yes, but there are really no tried-and-true methods that can be applied to general problems and are in the scope of this course.

On the other hand, if your specifications consist of a number of equalities or inequalities over some vector space (e.g. of states, inputs, frequency response or some combination thereof), it's reasonable to pose the problem of determining the region (maybe null) in the vector space that is the intersection of these constraints.