Linear programming system identification
From MaRDI portal
Publication:706953
DOI10.1016/J.EJOR.2003.07.019zbMATH Open1121.90093OpenAlexW2055775217MaRDI QIDQ706953FDOQ706953
Authors: Marvin D. Troutt, Suresh K. Tadisina, Changsoo Sohn, Alan A. Brandyberry
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
Recommendations
Parameter estimationLinear programmingMaximum likelihoodInverse optimizationConstraint matrix estimation
Cites Work
- Using duality to solve generalized fractional programming problems
- Fractional programming: The sum-of-ratios case
- Two Algorithms for Determining Volumes of Convex Polyhedra
- Global optimization of fractional programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polytope Volume Computation
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Inverse Optimization
- Calculating some inverse linear programming problems
- An algorithm for generalized fractional programs
- A Maximum Decisional Efficiency Estimation Principle
- Algorithms for generalized fractional programming
- A new algorithm for generalized fractional programs
- A Fast Algorithm for a Class of Generalized Fractional Programs
Cited In (5)
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)