Abstract
This paper deals with a linear programming problem with interval objective function coefficients. A new treatment of an interval objective function is presented by introducing the minimax regret criterion as used in decision theory. The properties of minimax regret solution and the relations with possibly and necessarily optimal solutions are investigated. Next, the minimax regret criterion is applied to the final determination of the solution when a reference solution set is given. A method of solution by a relaxation procedure is proposed. The solution is obtained by repetitional use of the simplex method. The minimax regret solution is obtained by the proposed solution method when the reference solution set is the set of possibly optimal solutions. In order to illustrate the proposed solution method, a numerical example is given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
