On ranking of feasible solutions of a bottleneck linear programming problem |
| |
Authors: | K Mathur M C Puri S Bansal |
| |
Institution: | (1) Department of Mathematics, Indian Institute of Technology, Hauz Khas, 110016 New Delhi, India;(2) Department of Mathematics, Janki Devi Mahavidyalaya, Poorvi Marg, 110060 New Dehli, India |
| |
Abstract: | Summary An algorithm for the ranking of the feasible solutions of a bottleneck linear programming problem in ascending order of values
of a concave bottleneck objective function is developed in this paper. The “best” feasible solution for a given value of the
bottleneck objective is obtained at each stage. It is established that only the extreme points of a convex polytope need to
be examined for the proposed ranking. Another algorithm, involving partitioning of the nodes, to rank the feasible solutions
of the bottleneck linear programming problem is proposed, and numerical illustrations for both are provided. |
| |
Keywords: | Bottleneck Min-Max Non-Convex Programming Extreme-Point Ranking |
本文献已被 SpringerLink 等数据库收录! |
|