Eliminating permanently dominated opportunities in multiple-criteria and multiple-constraint level linear programming

DOI10.1006/jmaa.1994.1175zbMath0826.90101OpenAlexW2022674418MaRDI QIDQ1329305

Po-Lung Yu, Dazhi Zhang, Yong Shi

Publication date: 4 July 1994

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1994.1175

zbMATH Keywords

multiple-constraint level linear programming problempermanently dominated opportunity

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (2)

LINEAR PROGRAMMING MODELS WITH CHANGEABLE PARAMETERS — THEORETICAL ANALYSIS ON "TAKING LOSS AT THE ORDERING TIME AND MAKING PROFIT AT THE DELIVERY TIME" ⋮ Admission control strategies for tandem Markovian loss systems

This page was built for publication: Eliminating permanently dominated opportunities in multiple-criteria and multiple-constraint level linear programming