Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability

DOI10.1016/0041-5553(80)90087-7zbMath0478.49029OpenAlexW2073063633WikidataQ58644636 ScholiaQ58644636MaRDI QIDQ3935771

V. A. Bushenkov, Alexander Lotov

Publication date: 1980

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(80)90087-7

zbMATH Keywords

algorithms for analyzing linear systemsgeneralized sets of attainability

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Attainable sets, reachability (93B03) Mathematical programming (90C99)

Related Items (7)

Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls ⋮ Finding sets of solutions to systems of nonlinear inequalities ⋮ Multiple objective analysis of long-term development strategies for a national economy ⋮ Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball ⋮ Approximation of convex sets by polytopes ⋮ Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems ⋮ A framework for participatory decision support using Pareto frontier visualization, goal identification and arbitration

This page was built for publication: Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability