Linear programming system identification
From MaRDI portal
Publication:706953
DOI10.1016/j.ejor.2003.07.019zbMath1121.90093OpenAlexW2055775217MaRDI QIDQ706953
Alan A. Brandyberry, Suresh K. Tadisina, Marvin D. Troutt, Changsoo Sohn
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.07.019
Linear programmingMaximum likelihoodParameter estimationInverse optimizationConstraint matrix estimation
Related Items (3)
Maximally productive input-output units ⋮ Linear programming system identification: the general nonnegative parameters case ⋮ Trade-off preservation in inverse multi-objective convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for generalized fractional programs
- Algorithms for generalized fractional programming
- Global optimization of fractional programs
- A new algorithm for generalized fractional programs
- Calculating some inverse linear programming problems
- Using duality to solve generalized fractional programming problems
- Fractional programming: The sum-of-ratios case
- Polytope Volume Computation
- Inverse Optimization
- Two Algorithms for Determining Volumes of Convex Polyhedra
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- A Fast Algorithm for a Class of Generalized Fractional Programs
- A Maximum Decisional Efficiency Estimation Principle
This page was built for publication: Linear programming system identification