eprintid: 4176
rev_number: 22
eprint_status: archive
userid: 351
dir: disk0/00/00/41/76
datestamp: 2016-01-15 02:04:38
lastmod: 2021-08-27 17:14:55
status_changed: 2016-01-15 02:04:38
type: monograph
metadata_visibility: show
item_issues_count: 2
creators_name: Inuiguchi, M.
creators_name: Sakawa, M.
creators_id: 1565
creators_id: 8446
title: An Achievement Rate Approach to Linear Programming Problems with an Interval Objective Function
ispublished: pub
internal_subjects: iis_met
internal_subjects: iis_mod
divisions: prog_mda
abstract: In this paper, we focus on a treatment of a linear programming problem with an interval objective function. From the viewpoint of the achievement rate, a new solution concept, a maximin achievement rate solution is proposed. Nice properties of this solution are shown: a maximin achievement rate solution is necessarily optimal when a necessarily optimal solution exists, and if not, then it is still a possibly optimal solution. An algorithm for a maximin achievement rate solution is proposed based on a relaxation procedure together with a simplex method. A numerical example is given to demonstrate the proposed solution algorithm.
date: 1994-05
date_type: published
publisher: WP-94-033
iiasapubid: WP-94-033
price: 10
creators_browse_id: 1340
creators_browse_id: 1550
full_text_status: public
monograph_type: working_paper
place_of_pub: IIASA, Laxenburg, Austria
pages: 24
coversheets_dirty: FALSE
fp7_type: info:eu-repo/semantics/book
citation:   Inuiguchi, M. <https://pure.iiasa.ac.at/view/iiasa/1340.html> & Sakawa, M. <https://pure.iiasa.ac.at/view/iiasa/1550.html>  (1994).  An Achievement Rate Approach to Linear Programming Problems with an Interval Objective Function.   IIASA Working Paper. IIASA, Laxenburg, Austria: WP-94-033     
document_url: https://pure.iiasa.ac.at/id/eprint/4176/1/WP-94-033.pdf