Name
Abstract | ||
|---|---|---|
We propose an outcome-space polyblock approximation algorithm for maximizing a function f(x) = phi(Cx) over the efficient solution set X-E of the multiple objective linear programming problem Max {Cx vertical bar x is an element of X}. The convergence of the algorithm is established. To illustrate the new algorithm, we apply it to the solution of a sample problem. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-87477-5_26 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Increasing function,Polyblock approximation algorithm,Multiple objective linear programming,Optimization over the efficient set | Convergence (routing),Approximation algorithm,Discrete mathematics,Mathematical optimization,Computer science,Solution set,Linear programming,Criss-cross algorithm | Conference |
Volume | ISSN | Citations |
14 | 1865-0929 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bach Kim Nguyen Thi | 1 | 0 | 0.34 |
| Le Thi Hoai An | 2 | 1038 | 80.20 |
| Minh Thanh Tran | 3 | 0 | 0.34 |