Solving and Analysing Goal Programming Models

Dylan Jones () and Mehrdad Tamiz ()
Additional contact information
Dylan Jones: University of Portsmouth
Mehrdad Tamiz: Kuwait University

Chapter Chapter 5 in Practical Goal Programming, 2010, pp 77-94 from Springer

Abstract: Abstract The purpose of this chapter is to explain how to ‘effectively’ solve and analyse goal programming models. The majority of the chapter will consider the solution and analysis of the three major goal programming variants using computerised software. The theory and methods of goal programming solution will also be detailed.

Keywords: Chebyshev Goal Programming; Chebyshev Variant; File Example; Ignizio; Priority Level (search for similar items in EconPapers)
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-5771-9_5

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

DOI: 10.1007/978-1-4419-5771-9_5

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 ().