Abstract
In this paper we analyze feasibility conditions for Fuzzy Linear Programming problems (FLP) and a special case where its constraints are composed by fuzzy numbers bounded by crisp numbers. We analyze three cases: strong, weak feasibility, and unfeasible FLPs, where strong feasibility is much more desirable than weak one since it generalizes feasible solutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zimmermann, H.J.: Fuzzy programming and linear programming with several objective functions. Fuzzy Sets Syst. 1(1), 45–55 (1978)
Zimmermann, H.J., Fullér, R.: Fuzzy reasoning for solving fuzzy mathematical programming problems. Fuzzy Sets Syst. 60(1), 121–133 (1993)
Fiedler, M., Nedoma, J., Ramík, J., Rohn, J., Zimmermann, K.: Linear Optimization Problems with Inexact Data. Springer, New York (2006)
Cerný, M., Hladík, M.: Optimization with uncertain, inexact or unstable data: linear programming and the interval approach. In: Nemec, R., Zapletal, F. (eds.) Proceedings of the 10th International Conference on Strategic Management and its Support by Information Systems, pp. 35–43. Technical University of Ostrava, VSB (2013)
Hladík, M.: Weak and strong solvability of interval linear systems of equations and inequalities. Linear Algebra Appl. 438(11), 4156–4165 (2013)
Ramík, J., Rimánek, J.: Inequality relation between fuzzy numbers and its use in fuzzy optimization. Fuzzy Sets Syst. 16, 123–138 (1985)
Figueroa-García, J.C., Chalco-Cano, Y., Román-Flores, H.: Distance measures for interval Type-2 fuzzy numbers. Discrete Appl. Math. 197(1), 93–102 (2015)
Figueroa-García, J.C., Hernández-Pérez, G.: On the computation of the distance between interval Type-2 fuzzy numbers using α-cuts. In: IEEE Proceedings of NAFIPS 2014, pp. 1–5. IEEE (2014)
Kreinovich, V., Tao, C.W.: Checking identities is computationally intractable (NP-Hard), so human provers will be always needed. Int. J. Intell. Syst. 19(1), 39–49 (2004)
Heindl, G., Kreinovich, V., Lakeyev, A.V.: Solving linear interval systems is NP-Hard even if we exclude overflow and underflow. Reliable Comput. 4(4), 383–388 (1998)
Lakeyev, A.V., Kreinovich, V.: NP-Hard classes of linear algebraic systems with uncertainties. Reliable Comput. 3(1), 51–81 (1997)
Kreinovich, V., Lakeyev, A.V., Noskov, S.I.: Optimal solution of interval linear systems is intractable (NP-Hard). Interval Comput. 1, 6–14 (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Figueroa-García, J.C., López-Bello, C.A., Hernández-Pérez, G. (2016). Feasibility Analysis for Fuzzy/Crisp Linear Programming Problems. In: Huang, DS., Han, K., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2016. Lecture Notes in Computer Science(), vol 9773. Springer, Cham. https://doi.org/10.1007/978-3-319-42297-8_76
Download citation
DOI: https://doi.org/10.1007/978-3-319-42297-8_76
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42296-1
Online ISBN: 978-3-319-42297-8
eBook Packages: Computer ScienceComputer Science (R0)