Titlebook: Recent Advances and Historical Development of Vector Optimization; Proceedings of an In Johannes Jahn,Werner Krabs Conference proceedings 1

自治

書目名稱Recent Advances and Historical Development of Vector Optimization影響因子(影響力)




書目名稱Recent Advances and Historical Development of Vector Optimization影響因子(影響力)學(xué)科排名




書目名稱Recent Advances and Historical Development of Vector Optimization網(wǎng)絡(luò)公開度




書目名稱Recent Advances and Historical Development of Vector Optimization網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Recent Advances and Historical Development of Vector Optimization被引頻次




書目名稱Recent Advances and Historical Development of Vector Optimization被引頻次學(xué)科排名




書目名稱Recent Advances and Historical Development of Vector Optimization年度引用




書目名稱Recent Advances and Historical Development of Vector Optimization年度引用學(xué)科排名




書目名稱Recent Advances and Historical Development of Vector Optimization讀者反饋




書目名稱Recent Advances and Historical Development of Vector Optimization讀者反饋學(xué)科排名

闖入

https://doi.org/10.1007/978-3-642-46618-2decision making; multi-criteria decision making; multi-objective optimization; optimization

悠然

978-3-540-18215-3Springer-Verlag Berlin Heidelberg 1987

休息

租約

preservative

Some Considerations about Computational Complexity for Multi Objective Combinatorial Problemsring the 70’s just a few papers have been published on multi objective (m.o.) integer linear programming. However no special emphasis was put on the important aspect of computational complexity. This can be certainly ascribed to the fact that the theory of NP—completeness was developing at a fast pace in those same years.

Charade

改變立場

Evaluation Functionals are the Extreme Points of a Basis for the Dual de C 1 + [a,b]We show via a Sobolev’s imbedding theorem that the evaluation functionals are the extreme points of a basis for the dual cone of the cone formed by real non-negative continuously differentiable functions on a bounded closed interval.

重畫只能放棄

Spangle

A Result of Farkas Type and Duality in Vector OptimizationBy a minimax approach we prove a result of Farkas type and use it to derive duality for vector optimization problems with and without constraint qualification.