Models for multicriteria resource allocation are constructed with the specific boxtriangular structure of a feasible region. The method of balance set equations is extended for the satisfaction level representation of the cost function space including the case of linearly dependent cost functions. O
โฆ LIBER โฆ
Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
โ Scribed by Seymour Kaplan
- Book ID
- 123686613
- Publisher
- INFORMS
- Year
- 1974
- Tongue
- English
- Weight
- 205 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0030-364X
- DOI
- 10.2307/169956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Box-triangular multiobjective linear pro
โ
P.Y. Ekel; E.A. Galperin
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 1023 KB
A multi-objective evolutionary algorithm
A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
โ
Dilip Datta; Carlos M. Fonseca; Kalyanmoy Deb
๐
Article
๐
2008
๐
Springer US
๐
English
โ 920 KB
Learning Automata-Based Solutions to the
โ
Granmo, O.-C.; Oommen, B.J.; Myrer, S.A.; Olsen, M.G.
๐
Article
๐
2007
๐
IEEE
๐
English
โ 254 KB
An Application of Dynamic Programming to
โ
Richard Bellman
๐
Article
๐
1965
๐
Society for Industrial and Applied Mathematics
๐
English
โ 117 KB
Fast scaling algorithms for M-convex fun
โ
Akiyoshi Shioura
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 256 KB
M-convex functions, introduced by Murota (Adv. Math. 124 (1996) 272; Math. Prog. 83 (1998) 313), enjoy various desirable properties as "discrete convex functions." In this paper, we propose two new polynomial-time scaling algorithms for the minimization of an M-convex function. Both algorithms apply
Balance set and Pareto solutions in line
โ
E.A. Galperin
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 924 KB