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

Fast and robust algorithm to compute exact polytope parameter bounds

Author

Listed:
  • Mo, S.H.
  • Norton, J.P.

Abstract

When bounds on the parameters of a linear-in-the-parameters model are computed, the exact feasible parameter set defined by the bounds (a polytope) is usually approximated by a simpler shape such as an ellipsoid. However, such simpler bounds may be much looser than the exact bounds. A new algorithm for updating the exact bounds is presented and compared with other recently published methods. Computational results illustrate exact polytope-bound updating by this algorithm from records of realistic length.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matcom:v:32:y:1990:i:5:p:481-493
    DOI: 10.1016/0378-4754(90)90004-3
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0378475490900043
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/0378-4754(90)90004-3?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. 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.
    3. 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.
    4. Jan Telgen, 1983. "Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints," Management Science, INFORMS, vol. 29(10), pages 1209-1222, October.
    5. T. H. Mattheiss, 1973. "An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities," Operations Research, INFORMS, vol. 21(1), pages 247-260, February.
    6. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Pronzato, Luc & Walter, Eric, 1990. "Experiment design for bounded-error models," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 571-584.
    9. 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.
    10. Norton, J.P. & Mo, S.H., 1990. "Parameter bounding for time-varying systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 527-534.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Liu, Yanwu & Tu, Yan & Zhang, Zhongzhen, 2021. "The row pivoting method for linear programming," Omega, Elsevier, vol. 100(C).
    6. 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.
    7. Nonås, Sigrid Lise, 2009. "Finding and identifying optimal inventory levels for systems with common components," European Journal of Operational Research, Elsevier, vol. 193(1), pages 98-119, February.
    8. Daalmans Jacco, 2018. "Constraint Simplification for Data Editing of Numerical Variables," Journal of Official Statistics, Sciendo, vol. 34(1), pages 27-39, March.
    9. Piet-Lahanier, H. & Walter, E., 1990. "Characterization of non-connected parameter uncertainty regions," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 553-560.
    10. repec:cep:stiecm:em/2012/559 is not listed on IDEAS
    11. 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.
    12. Li, Changmin & Yang, Hai & Zhu, Daoli & Meng, Qiang, 2012. "A global optimization method for continuous network design problems," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1144-1158.
    13. Tatiana Komarova, 2012. "Binary Choice Models with Discrete Regressors: Identification and Misspecification," STICERD - Econometrics Paper Series 559, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
    14. 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.
    15. 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.
    16. Obuchowska, Wieslawa T., 1998. "Infeasibility analysis for systems of quadratic convex inequalities," European Journal of Operational Research, Elsevier, vol. 107(3), pages 633-643, June.
    17. repec:cep:stiecm:/2012/559 is not listed on IDEAS
    18. 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.
    19. Shary, Sergey P., 1995. "Solving the linear interval tolerance problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 39(1), pages 53-85.
    20. Ida, Masaaki, 2005. "Efficient solution generation for multiple objective linear programming based on extreme ray generation method," European Journal of Operational Research, Elsevier, vol. 160(1), pages 242-251, January.
    21. Komarova, Tatiana, 2013. "Binary choice models with discrete regressors: Identification and misspecification," Journal of Econometrics, Elsevier, vol. 177(1), pages 14-33.
    22. 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.

    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:32:y:1990:i:5:p:481-493. 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.