Advanced Topics on the MUSA Method

Evangelos Grigoroudis () and Yannis Siskos ()
Additional contact information
Evangelos Grigoroudis: Technical University of Crete
Yannis Siskos: University of Piraeus

Chapter Chapter 6 in Customer Satisfaction Evaluation, 2010, pp 149-169 from Springer

Abstract: Abstract The computational difficulty of the MUSA method is based on the number of variables and the number of constraints in the formulated LP. The method consists of two distinct stages: in the first stage an initial LP is solved in order to obtain an optimum value for the selected error function, while in the second stage a heuristic algorithm is used (solving a number of LPs) in order to explore the multiple or near optimal solutions space.

Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-1640-2_6

Ordering information: This item can be ordered from
http://www.springer.com/9781441916402

DOI: 10.1007/978-1-4419-1640-2_6

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().