Solution of parametrized linear inequalities by Fourier elimination and its applications (Q1120477): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of a linear system of inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of minimum-time feedback control laws for discrete-time systems with state-control constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal infinite-horizon control and the stabilization of linear discrete-time systems: State-control constraints and nonquadratic cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral functions and multiparametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier's Method of Linear Programming and Its Dual / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:21, 19 June 2024

scientific article
Language Label Description Also known as
English
Solution of parametrized linear inequalities by Fourier elimination and its applications
scientific article

    Statements

    Solution of parametrized linear inequalities by Fourier elimination and its applications (English)
    0 references
    0 references
    1990
    0 references
    The parametric solution of a linear system of inequalities Ax\(\leq Bb\), with parameter b, is considered. Fourier elimination is used to give a facial representation for the set of b-values for which the system is consistent. Some interesting applications of the problem are discussed. Although the worst case complexity of the method is an exponential function of the size of A, the computations are intuitive and very simple.
    0 references
    polyhedra
    0 references
    parametric solution
    0 references
    linear system of inequalities
    0 references
    Fourier elimination
    0 references
    facial representation
    0 references
    worst case complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references