Range Programming : introducing a 'satisficing range' in a LP

Abstract : A new approach to the problem of minimizing a quartic (fourth order) cost function, subject to linear constraints, is presented. A "satisficing range" is introduced for each variable (i.e. a range in which all values of the variable are considered to entail the same minimal cost), leading to a new linear formulation ("range programming"). Improvements in results over previous approaches are reported for a specific example (due to Goodman), and should be expected in general.
Document type :
Journal articles
Complete list of metadatas

https://hal-hec.archives-ouvertes.fr/hal-00820498
Contributor : Antoine Haldemann <>
Submitted on : Sunday, May 5, 2013 - 7:44:48 PM
Last modification on : Sunday, May 5, 2013 - 7:45:30 PM

Links full text

Identifiers

Collections

Citation

Gilles Laurent. Range Programming : introducing a 'satisficing range' in a LP. Management Science, INFORMS, 1976, 22 (6), pp.713-716. ⟨10.1287/mnsc.22.6.713⟩. ⟨hal-00820498⟩

Share

Metrics

Record views

244