IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v34y1992i6p515-524.html
   My bibliography  Save this article

Comparison of methods for solving sets of linear inequalities in the bounded-error context

Author

Listed:
  • Piet-Lahanier, Hélène
  • Veres, Sándor M.
  • Walter, Eric

Abstract

Effective recursive updating of the solution set of linear inequalities has recently gained importance in the area of parameter bounding for system identification, prediction and control. When it is not empty, this solution set is a convex polyhedron, usually a convex polytope in the context of parameter bounding. Several algorithms have been proposed in the literature to update this polyhedron when a new inequality is introduced. This paper describes three of them in a unified framework and compares them on the number of operations involved and the memory space required.

Suggested Citation

  • Piet-Lahanier, Hélène & Veres, Sándor M. & Walter, Eric, 1992. "Comparison of methods for solving sets of linear inequalities in the bounded-error context," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 34(6), pages 515-524.
    • Handle: RePEc:eee:matcom:v:34:y:1992:i:6:p:515-524
    DOI: 10.1016/0378-4754(92)90038-I
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/037847549290038I
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/0378-4754(92)90038-I?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Walter, Eric & Piet-Lahanier, Hélène, 1990. "Estimation of parameter bounds from bounded-error data: a survey," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 449-468.
    2. T. H. Matheiss & David S. Rubin, 1980. "A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets," Mathematics of Operations Research, INFORMS, vol. 5(2), pages 167-185, May.
    3. Mo, S.H. & Norton, J.P., 1990. "Fast and robust algorithm to compute exact polytope parameter bounds," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 481-493.
    4. Broman, V. & Shensa, M.J., 1990. "A compact algorithm for the intersection and approximation of N-dimensional polytopes," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 469-480.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jaulin, Luc & Walter, Eric, 1993. "Guaranteed nonlinear parameter estimation from bounded-error data via interval analysis," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(2), pages 123-137.
    2. Mo, S.H. & Norton, J.P., 1990. "Fast and robust algorithm to compute exact polytope parameter bounds," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 481-493.
    3. Piet-Lahanier, H. & Walter, E., 1990. "Exact recursive characterization of feasible parameter sets in the linear case," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 495-504.
    4. Keesman, Karel, 1990. "Membership-set estimation using random scanning and principal component analysis," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 535-543.
    5. Clement, Thierry & Gentil, Sylviane, 1990. "Recursive membership set estimation for output-error models," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 505-513.
    6. Walter, Eric & Piet-Lahanier, Hélène, 1990. "Estimation of parameter bounds from bounded-error data: a survey," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 449-468.
    7. da Silva, Ivan N. & de Arruda, Lucia V.R. & do Amaral, Wagner C., 1999. "A novel approach to robust parameter estimation using neurofuzzy systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 48(3), pages 251-268.
    8. repec:cep:stiecm:em/2012/559 is not listed on IDEAS
    9. Marco Stenborg Petterson & David Seim & Jesse M. Shapiro, 2023. "Bounds on a Slope from Size Restrictions on Economic Shocks," American Economic Journal: Microeconomics, American Economic Association, vol. 15(3), pages 552-572, August.
    10. Liesiö, Juuso & Andelmin, Juho & Salo, Ahti, 2020. "Efficient allocation of resources to a portfolio of decision making units," European Journal of Operational Research, Elsevier, vol. 286(2), pages 619-636.
    11. Haines, Linda M., 1998. "A statistical approach to the analytic hierarchy process with interval judgements. (I). Distributions on feasible regions," European Journal of Operational Research, Elsevier, vol. 110(1), pages 112-125, October.
    12. repec:cep:stiecm:/2012/559 is not listed on IDEAS
    13. Makowski, David & Hendrix, Eligius M. T. & van Ittersum, Martin K. & Rossing, Walter A. H., 2001. "Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in farming system design," European Journal of Operational Research, Elsevier, vol. 132(2), pages 425-438, July.
    14. Komarova, Tatiana, 2013. "Binary choice models with discrete regressors: Identification and misspecification," Journal of Econometrics, Elsevier, vol. 177(1), pages 14-33.
    15. Harju, Mikko & Liesiö, Juuso & Virtanen, Kai, 2019. "Spatial multi-attribute decision analysis: Axiomatic foundations and incomplete preference information," European Journal of Operational Research, Elsevier, vol. 275(1), pages 167-181.
    16. Enríquez, R. & Jiménez, M.J. & Heras, M.R., 2017. "Towards non-intrusive thermal load Monitoring of buildings: BES calibration," Applied Energy, Elsevier, vol. 191(C), pages 44-54.
    17. Pey-Chun Chen & Pierre Hansen & Brigitte Jaumard & Hoang Tuy, 1998. "Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming," Operations Research, INFORMS, vol. 46(4), pages 548-562, August.
    18. José H. Dulá & Francisco J. López, 2006. "Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 97-110, February.
    19. Broman, V. & Shensa, M.J., 1990. "A compact algorithm for the intersection and approximation of N-dimensional polytopes," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 469-480.
    20. Mohammadali S. Monfared & Sayyed Ehsan Monabbati & Mahsa Mahdipour Azar, 2020. "Bi-objective optimization problems with two decision makers: refining Pareto-optimal front for equilibrium solution," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 567-584, June.
    21. Pooriya Beyhaghi & Daniele Cavaglieri & Thomas Bewley, 2016. "Delaunay-based derivative-free optimization via global surrogates, part I: linear constraints," Journal of Global Optimization, Springer, vol. 66(3), pages 331-382, November.
    22. Elliot Noma, 1992. "Determining implied relationships on incomplete ordinal data," Quality & Quantity: International Journal of Methodology, Springer, vol. 26(4), pages 427-434, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:34:y:1992:i:6:p:515-524. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.