Bounds on the opportunity cost of neglecting reoptimization in mathematical programming

Simple item page
dc.citation.epage1012en_US
dc.citation.issueNumber7en_US
dc.citation.spage1009en_US
dc.citation.volumeNumber46en_US
dc.contributor.authorOğuz, O.en_US
dc.date.accessioned2016-02-08T10:37:58Z
dc.date.available2016-02-08T10:37:58Z
dc.date.issued2000en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractPostoptimality or sensitivity analysis are well-developed subjects in almost all branches of mathematical programming. In this note, we propose a simple formula which can be used to get preliminary bounds on the value of this type of analysis for a specific class of mathematical programming problems. We also show that our bounds are tight.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:37:58Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2000en
dc.identifier.doi10.1287/mnsc.46.7.1009.12041en_US
dc.identifier.issn0025-1909
dc.identifier.urihttp://hdl.handle.net/11693/25025
dc.language.isoEnglishen_US
dc.publisherINFORMSen_US
dc.relation.isversionofhttps://doi.org/10.1287/mnsc.46.7.1009.12041en_US
dc.source.titleManagement Scienceen_US
dc.subjectConvergence of numerical methodsen_US
dc.subjectSensitivity analysisen_US
dc.subjectPostoptimality analysisen_US
dc.subjectWorst case analysisen_US
dc.subjectMathematical programmingen_US
dc.titleBounds on the opportunity cost of neglecting reoptimization in mathematical programmingen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Bounds on the opportunity cost of neglecting reoptimization in mathematical programming.pdf
Size:
568.94 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering