A graphical bicriteria approach to the resource allocation problem
From MaRDI portal
Publication:1095044
DOI10.1016/0377-2217(88)90458-4zbMath0631.90075OpenAlexW2032681802MaRDI QIDQ1095044
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90458-4
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Related Items (1)
Cites Work
- Unnamed Item
- A graphical method to solve a family of allocation problems
- A graphical method to solve a maximin allocation problem
- Vector maximization with two objective functions
- On the characterization of Pareto-optimal solutions in bicriterion optimization
- Simple Ranking Methods for Allocation of One Resource
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Technical Note—Allocation of Effort Resources among Competing Activities
- An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
- Interactive solution of bi-criteria mathematical programs
This page was built for publication: A graphical bicriteria approach to the resource allocation problem