Abstract
Several programming models are introduced with the consideration of available unascertained information. In this case, the so-called unascertained information is some numerical values whose ranges are known but their exact values are not. These models resolve several vital weaknesses of the traditional programming methods to a certain degree. Our study includes considerations of linear and non-linear programming models with grey parameters, grey 0–1 programming, and satisfactory and quasi-optimal solutions of grey linear programmings. Finally, some practical applications are given in order to test the applicability of our theory. Copyright © 1999 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Free) 
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 call
