Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Enumeration of All Possibly Optimal Vertices with Possible Optimality Degrees in Linear Programming Problems with a Possibilistic Objective Function

  • Published:
Fuzzy Optimization and Decision Making Aims and scope Submit manuscript

Abstract

In this paper, we treat linear programming problems with fuzzy objective function coefficients. To such a problem, the possibly optimal solution set is defined as a fuzzy set. It is shown that any possibly optimal solution can be represented by a convex combination of possibly optimal vertices. A method to enumerate all possibly optimal vertices with their membership degrees is developed. It is shown that, given a possibly optimal extreme point with a higher membership degree, the membership degree of an adjacent extreme point is calculated by solving a linear programming problem and that all possibly optimal vertices are enumerated sequentially by tracing adjacent possibly optimal extreme points from a possibly optimal extreme point with the highest membership degree.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Bereanu,B.(1967).''On Stochastic Linear Programming Distribution Problems:Stochastic Technology Matrix,''Z.Wahrscheinlichkeitstheorie u verw.8,148-152.

  • Bereanum,B.(1971).''The Distribution Problem in Stochastic Linear Programming:The Cartesian Integration Method,'':Center of Mathematical Statistics of the Academy of the Socialist Republic of Romania,Bucharest,Reprint No.7103.

  • Inuiguchi,M.and H.Ichihashi (1990).''Relative Modalities and Their Use in Possibilistic Linear Pro-gramming,''Fuzzy Sets and Systems,35,303-323.

    Google Scholar 

  • Inuiguchi,M.and J.Ramý ´k.(2000).''Possibilistic Linear Programming:A Brief Review of Fuzzy Mathematical Programming and a Comparison with Stochastic Programming in Portfolio Selection Problem,''Fuzzy Sets and Systems,111,3-28.

    Google Scholar 

  • Inuiguchi,M.and M.Sakawa,(1994).''Possible and Necessary Optimality Tests in Possibilistic Linear Programming Problems,''Fuzzy Sets and System,67,29-46.

    Google Scholar 

  • Inuiguchi,M.and M.Sakawa (1996).''Possible and Necessary E.ciency in Possibilistic Multiobjective Linear Programming Problems and Possible Efficiency Test,''Fuzzy Sets and Systems,78,231-241.

    Google Scholar 

  • Inuiguchi,M.and M.Sakerwa (1998).''Robust Optimization under Softness in a Fuzzy Linear Pro-gramming Problem,''Int.J.Approximate Reasoning,18,21-34.

    Google Scholar 

  • Steuer, R.E.(1981).''Algorithms for Linear Programming Problems with Interval Objective Function Coe.cients,''Mathematics of Operations Research 6,333-348.

    Google Scholar 

  • Steuer, R.E.(1985).Multiple Criteria Optimization:Theory,Computation,and Application.New York: John Wiley & Sons.

  • M.Zeleny,(1974).Linear Multiobjective Programming.Berlin: Springer-Verlag.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Inuiguchi, M. Enumeration of All Possibly Optimal Vertices with Possible Optimality Degrees in Linear Programming Problems with a Possibilistic Objective Function. Fuzzy Optimization and Decision Making 3, 311–326 (2004). https://doi.org/10.1007/s10700-004-4201-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10700-004-4201-5