This paper deals with the complete solutions of multiple objective transportation problems with possibilistic coefficients. We consider the problem by incorporating possibilistic data into the coefficients of objective functions. A solution concept that is attractive from the standpoint of efficienc
โฆ LIBER โฆ
Multiple objective programming problems with possibilistic coefficients
โ Scribed by M.K. Luhandjula
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 415 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Complete solutions of multiple objective
โ
Mohammad Lotfy Hussein
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 361 KB
Linear programming with a possibilistic
โ
M.K. Luhandjula
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 546 KB
On multiple objective programming proble
โ
J.H Chou; Wei-Shen Hsia; Tan-Yu Lee
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 515 KB
Weighted coefficients in two-phase appro
โ
Sy-Ming Guu; Yan-Kuen Wu
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 257 KB
Multiple objective programming with piec
โ
Stefan Nickel; Margaret M. Wiecek
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 135 KB
An approach to generating all efficient solutions for multiple objective programs with piecewise linear objective functions and linear constraints is presented. The approach is based on the decomposition of the feasible set into subsets, referred to as cells, so that the original problem reduces to
Multiple objective dynamic programming w
โ
J.S.H. Kornbluth
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 520 KB