Linear programming system identification
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 46855 (Why is no real title available?)
- scientific article; zbMATH DE number 1538124 (Why is no real title available?)
- A Fast Algorithm for a Class of Generalized Fractional Programs
- A Maximum Decisional Efficiency Estimation Principle
- A new algorithm for generalized fractional programs
- Algorithms for generalized fractional programming
- An algorithm for generalized fractional programs
- Calculating some inverse linear programming problems
- Fractional programming: The sum-of-ratios case
- Global optimization of fractional programs
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Inverse Optimization
- Polytope Volume Computation
- Two Algorithms for Determining Volumes of Convex Polyhedra
- Using duality to solve generalized fractional programming problems
Cited in
(5)- Linear programming system identification: the general nonnegative parameters case
- Trade-off preservation in inverse multi-objective convex optimization
- scientific article; zbMATH DE number 3860823 (Why is no real title available?)
- Mixed linear system estimation and identification
- Maximally productive input-output units
This page was built for publication: Linear programming system identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706953)