schliessen

Filtern

 

Bibliotheken

Bounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming

Postoptimality 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... Full description

Journal Title: Management Science 2000, Vol.46 (7), p.1009-1012
Main Author: Oguz, Osman
Format: Electronic Article Electronic Article
Language: English
Subjects:
Quelle: Alma/SFX Local Collection
Publisher: Linthicum: INFORMS
ID: ISSN: 0025-1909
Link: http://econpapers.repec.org/article/inmormnsc/v_3a46_3ay_3a2000_3ai_3a7_3ap_3a1009-1012.htm
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_highwire_informs_mansci_46_7_1009
title: Bounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming
format: Article
creator:
  • Oguz, Osman
subjects:
  • Algorithms
  • case Analysis
  • Coefficients
  • Convergence of numerical methods
  • Linear programming
  • Management science
  • Mathematical intervals
  • Mathematical programming
  • Nonlinear programming
  • Objective functions
  • Opportunity costs
  • Optimal solutions
  • Optimization
  • Postoptimality analysis
  • Sensitivity analysis
  • Studies
  • tolerance limits
  • Variable coefficients
  • worst
  • Worst case analysis
ispartof: Management Science, 2000, Vol.46 (7), p.1009-1012
description: Postoptimality 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.
language: eng
source: Alma/SFX Local Collection
identifier: ISSN: 0025-1909
fulltext: fulltext
issn:
  • 0025-1909
  • 1526-5501
url: Link


@attributes
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
RANK1.8492687
LOCALfalse
PrimoNMBib
record
control
sourceidgale_highw
recordidTN_cdi_highwire_informs_mansci_46_7_1009
sourceformatXML
sourcesystemPC
galeidA64494598
jstor_id2661615
sourcerecordidA64494598
originalsourceidFETCH-LOGICAL-1612t-52a3c6fb21947377955a2b3a5bdced1eaf881fa59dc92bd9a956180748437d2d3
addsrcrecordideNqNkl-L1DAUxYsoOK5-g30oPgnSMX-apHlcB3UXxl0RxceQNmknwySpSeoyfnrTrc6u4IOU20vS8zvkNqcoziFYQ9SwN9bFbl3TNVtDAHjeAzV8VKwgQbQiBMDHxQoARCrIAX9aPItxDwBgDaOr4ttbPzkVS-_KtNPlzTj6kCZn0rHc-JhK35fXejjoLhk3lJ-1H5Ox5qdMJhPGlR9lxmxedvJQfgp-CNLaLH1ePOnlIeoXv_tZ8fX9uy-by2p78-Fqc7GtIIUoVQRJ3NG-RZDXDDPGCZGoxZK0qtMKatk3Dewl4arjqFVcckJhA1jd1JgppPBZcb34-lE7aYIWYzBWhqPw0gjldBJKq2kUt70AAAqMuAIcScYpU0oz0jDUYNYyxhSnkmTDl4vhGPz3Scck9n4KLs8gEMSoJoDBe9EgD1oY1_sUZGdN7MQFrWteE95kUfUPUX6UtqbzTvcm7z_Uv36gb6donI75Fc2wS3GQU4x_qetF3QUfY9D9aXAIxJwKMadC1FQwMadC3KUiY9sFC3rU3YkxzvpwB_wQWGYIy2MulHOSm8nFco25Fi8Akdglm-3OF7t9TD6c7BCl-X7nn4mXz_P0wcb_PeOrhdrlyW_nO_2DW5n15h7AvwB2Burx
sourcetypeOpen Access Repository
isCDItrue
recordtypearticle
pqid213245071
display
typearticle
titleBounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming
sourceAlma/SFX Local Collection
creatorOguz, Osman
creatorcontribOguz, Osman
descriptionPostoptimality 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.
identifier
0ISSN: 0025-1909
1EISSN: 1526-5501
2DOI: 10.1287/mnsc.46.7.1009.12041
3CODEN: MNSCDI
languageeng
publisherLinthicum: INFORMS
subjectAlgorithms ; case Analysis ; Coefficients ; Convergence of numerical methods ; Linear programming ; Management science ; Mathematical intervals ; Mathematical programming ; Nonlinear programming ; Objective functions ; Opportunity costs ; Optimal solutions ; Optimization ; Postoptimality analysis ; Sensitivity analysis ; Studies ; tolerance limits ; Variable coefficients ; worst ; Worst case analysis
ispartofManagement Science, 2000, Vol.46 (7), p.1009-1012
rights
0Copyright 2000 INFORMS
1COPYRIGHT 2000 Institute for Operations Research and the Management Sciences
2Copyright Institute for Operations Research and the Management Sciences Jul 2000
lds50peer_reviewed
oafree_for_read
citesFETCH-LOGICAL-1612t-52a3c6fb21947377955a2b3a5bdced1eaf881fa59dc92bd9a956180748437d2d3
links
openurl$$Topenurl_article
openurlfulltext$$Topenurlfull_article
thumbnail$$Usyndetics_thumb_exl
backlink$$Uhttp://econpapers.repec.org/article/inmormnsc/v_3a46_3ay_3a2000_3ai_3a7_3ap_3a1009-1012.htm$$DView record in RePEc
search
creatorcontribOguz, Osman
title
0Bounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming
1Management Science
descriptionPostoptimality 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.
subject
0Algorithms
1case Analysis
2Coefficients
3Convergence of numerical methods
4Linear programming
5Management science
6Mathematical intervals
7Mathematical programming
8Nonlinear programming
9Objective functions
10Opportunity costs
11Optimal solutions
12Optimization
13Postoptimality analysis
14Sensitivity analysis
15Studies
16tolerance limits
17Variable coefficients
18worst
19Worst case analysis
issn
00025-1909
11526-5501
fulltexttrue
rsrctypearticle
creationdate2000
recordtypearticle
recordideNqNkl-L1DAUxYsoOK5-g30oPgnSMX-apHlcB3UXxl0RxceQNmknwySpSeoyfnrTrc6u4IOU20vS8zvkNqcoziFYQ9SwN9bFbl3TNVtDAHjeAzV8VKwgQbQiBMDHxQoARCrIAX9aPItxDwBgDaOr4ttbPzkVS-_KtNPlzTj6kCZn0rHc-JhK35fXejjoLhk3lJ-1H5Ox5qdMJhPGlR9lxmxedvJQfgp-CNLaLH1ePOnlIeoXv_tZ8fX9uy-by2p78-Fqc7GtIIUoVQRJ3NG-RZDXDDPGCZGoxZK0qtMKatk3Dewl4arjqFVcckJhA1jd1JgppPBZcb34-lE7aYIWYzBWhqPw0gjldBJKq2kUt70AAAqMuAIcScYpU0oz0jDUYNYyxhSnkmTDl4vhGPz3Scck9n4KLs8gEMSoJoDBe9EgD1oY1_sUZGdN7MQFrWteE95kUfUPUX6UtqbzTvcm7z_Uv36gb6donI75Fc2wS3GQU4x_qetF3QUfY9D9aXAIxJwKMadC1FQwMadC3KUiY9sFC3rU3YkxzvpwB_wQWGYIy2MulHOSm8nFco25Fi8Akdglm-3OF7t9TD6c7BCl-X7nn4mXz_P0wcb_PeOrhdrlyW_nO_2DW5n15h7AvwB2Burx
startdate20000701
enddate20000701
creatorOguz, Osman
general
0INFORMS
1Institute for Operations Research and the Management Sciences
scope
0DKI
1X2L
2AAYXX
3CITATION
43V.
57WY
67WZ
77X5
87XB
987Z
1088C
1188G
128A3
138AO
148BJ
158FI
168FJ
178FK
188FL
19ABUWG
20AZQEC
21BENPR
22BEZIV
23DWQXO
24FQK
25FRNLG
26FYUFA
27F~G
28GHDGH
29GNUQQ
30JBE
31K60
32K6~
33L.-
34M0C
35M0T
36M2M
37PQBIZ
38PQBZA
39PQEST
40PQQKQ
41PQUKI
42PRINS
43PYYUZ
44Q9U
45BOBZL
46CLFQK
sort
creationdate20000701
titleBounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming
authorOguz, Osman
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-1612t-52a3c6fb21947377955a2b3a5bdced1eaf881fa59dc92bd9a956180748437d2d3
rsrctypearticles
prefilterarticles
languageeng
creationdate2000
topic
0Algorithms
1case Analysis
2Coefficients
3Convergence of numerical methods
4Linear programming
5Management science
6Mathematical intervals
7Mathematical programming
8Nonlinear programming
9Objective functions
10Opportunity costs
11Optimal solutions
12Optimization
13Postoptimality analysis
14Sensitivity analysis
15Studies
16tolerance limits
17Variable coefficients
18worst
19Worst case analysis
toplevel
0peer_reviewed
1online_resources
creatorcontribOguz, Osman
collection
0RePEc IDEAS
1RePEc
2CrossRef
3ProQuest Central (Corporate)
4ABI/INFORM Collection
5ABI/INFORM Global (PDF only)
6Entrepreneurship Database
7ProQuest Central (purchase pre-March 2016)
8ABI/INFORM Global (Alumni Edition)
9Healthcare Administration Database (Alumni)
10Psychology Database (Alumni)
11Entrepreneurship Database (Alumni Edition)
12ProQuest Pharma Collection
13International Bibliography of the Social Sciences (IBSS)
14Hospital Premium Collection
15Hospital Premium Collection (Alumni Edition)
16ProQuest Central (Alumni) (purchase pre-March 2016)
17ABI/INFORM Collection (Alumni Edition)
18ProQuest Central (Alumni Edition)
19ProQuest Central Essentials
20ProQuest Central
21Business Premium Collection
22ProQuest Central Korea
23International Bibliography of the Social Sciences
24Business Premium Collection (Alumni)
25Health Research Premium Collection
26ABI/INFORM Global (Corporate)
27Health Research Premium Collection (Alumni)
28ProQuest Central Student
29International Bibliography of the Social Sciences
30ProQuest Business Collection (Alumni Edition)
31ProQuest Business Collection
32ABI/INFORM Professional Advanced
33ABI/INFORM Global
34Healthcare Administration Database
35Psychology Database
36ProQuest One Business
37ProQuest One Business (Alumni)
38ProQuest One Academic Eastern Edition
39ProQuest One Academic
40ProQuest One Academic UKI Edition
41ProQuest Central China
42ABI/INFORM Collection China
43ProQuest Central Basic
44OpenAIRE (Open Access)
45OpenAIRE
jtitleManagement Science
delivery
delcategoryRemote Search Resource
fulltextfulltext
addata
auOguz, Osman
formatjournal
genrearticle
ristypeJOUR
atitleBounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming
jtitleManagement Science
seriestitleManagement Science
date2000-07-01
risdate2000
volume46
issue7
spage1009
epage1012
pages1009-1012
issn0025-1909
eissn1526-5501
codenMNSCDI
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.
copLinthicum
pubINFORMS
doi10.1287/mnsc.46.7.1009.12041
oafree_for_read