Multi-parametric analysis of the maximum tolerance in a linear programming problem

1993 ◽  
Vol 67 (1) ◽  
pp. 75-87 ◽  
Author(s):  
Hsiao-Fan Wang ◽  
Chen-Sheng Huang
2012 ◽  
Vol 60 (2) ◽  
pp. 217-222
Author(s):  
Sanwar Uddin Ahmad ◽  
M. Babul Hasan ◽  
M. Ainul Islam

Linear Programming problem (LPP)s with upper bounded variables can be solved using the Bounded Simplex method, without the explicit consideration of the upper bounded constraints. One can consider the upper bounded constraints explicitly and perform the regular righthand- side parametric analysis of LPPs with bounded variables. This paper develops a method to perform the parametric analysis where the upper bounded constraints are considered implicitly, thus reduce the size of the basis matrix.DOI: http://dx.doi.org/10.3329/dujs.v60i2.11521 Dhaka Univ. J. Sci. 60(2): 217-222, 2012 (July) 


2017 ◽  
Vol 27 (3) ◽  
pp. 563-573 ◽  
Author(s):  
Rajendran Vidhya ◽  
Rajkumar Irene Hepzibah

AbstractIn a real world situation, whenever ambiguity exists in the modeling of intuitionistic fuzzy numbers (IFNs), interval valued intuitionistic fuzzy numbers (IVIFNs) are often used in order to represent a range of IFNs unstable from the most pessimistic evaluation to the most optimistic one. IVIFNs are a construction which helps us to avoid such a prohibitive complexity. This paper is focused on two types of arithmetic operations on interval valued intuitionistic fuzzy numbers (IVIFNs) to solve the interval valued intuitionistic fuzzy multi-objective linear programming problem with pentagonal intuitionistic fuzzy numbers (PIFNs) by assuming differentαandβcut values in a comparative manner. The objective functions involved in the problem are ranked by the ratio ranking method and the problem is solved by the preemptive optimization method. An illustrative example with MATLAB outputs is presented in order to clarify the potential approach.


Sign in / Sign up

Export Citation Format

Share Document