On ranking of feasible solutions of a bottleneck linear programming problem

K. Mathur, M. Puri and S. Bansal

TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 1995, vol. 3, issue 2, 265-283

Keywords: Bottleneck; Min-Max; Non-Convex Programming; Extreme-Point Ranking (search for similar items in EconPapers)
Date: 1995
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/BF02568589 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:topjnl:v:3:y:1995:i:2:p:265-283

Ordering information: This journal article can be ordered from
http://link.springer.de/orders.htm

DOI: 10.1007/BF02568589

Access Statistics for this article

TOP: An Official Journal of the Spanish Society of Statistics and Operations Research is currently edited by Juan José Salazar González and Gustavo Bergantiños

More articles in TOP: An Official Journal of the Spanish Society of Statistics and Operations Research from Springer, Sociedad de Estadística e Investigación Operativa
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().