Abstract
The current models and methods for PLP are usually restricted on some special types and usually the same type of possibilistic distribution. This paper focuses on linear programming problems with general possibilistic resources (GRPLP) and linear programming problems with general possibilistic objective coefficients (GOPLP). By introducing some new concepts of the largest most possible point, the smallest most possible point, the most optimistic point and the most possible decision, a new approach for formulating possibilistic constraints through general possibilistic resources and a satisfactory solution method will be discussed in this paper. A most possible decision method for GRPLP and a dual approach for GOPLP will be proposed for solving complex industrial decision problems.
Sign-in/Register to access full text options 
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.
