1. 3) HORST R. Global Optimization : Deterministic Approacheshird, Revised and Enlarged Edition. Springer-Verlag. (1995)
2. 4) INUIGUCHI M. On Computation Methods of the Minimax Regret Solution for Linear Programming Problems with Uncertain Objective Function Coefficients. Proc. of 1999 IEEE Int. Conf. on Systems, Man, and Cybernetics. (1999) vol.III, p.979-984.
3. 5) INUIGUCHI M. An Achivement Rate Approach to Linear Programming Problem with Convex Polyhedral Objective Coefficients. Proc. of the Third Asian Fuzzy Systems Symposium. (1998) p.501-505.
4. 6) IDA M. Optimal Basis of Possibilistic Linear Programming Problem. Proc. of the Forth Asian Fuzzy Systems Symposium. (2000) vol.1, p.95-99.
5. 7) INUIGUCHI M. Enumeration of All Possibly Optimal Vertices with Possible Optimality Degrees in Possibilistic Linear Programming Problems. Proc. of the Forth Asian Fuzzy Systems Symposium. (2000) vol.1, p.386-391.