CHARACTERIZATION OF THE SOLUTIONS OF MULTIOBJECTIVE LINEAR PROGRAMMING WITH A GENERAL DOMINATED CONE
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we give a characterization of the solutions of a multiobjective linear programming problem with a general dominated cone. In such a problem the domination structure defined by the cone plays an important role. The dominated cone we adopt as the criterion in this paper is expressed in the form of a system of linear inequalities, but is not assumed to be acute. We first give a characterization theorem of the solutions, and next show, by the use of the theorem, that when the cone is not acute our problem can be transformed to another optimization problem with respect to a certain acute cone.
- Research Association of Statistical Sciencesの論文
- 1996-03-00
Research Association of Statistical Sciences | 論文
- CLUSTERING BY A FUZZY METRIC : APPLICATIONS TO THE CLUSTER-MEDIAN PROBLEM
- A FAMILY OF REGRESSION MODELS HAVING PARTIALLY ADDITIVE AND MULTIPLICATIVE COVARIATE STRUCTURE
- AN OPTIMAL STOPPING PROBLEM ON TREE
- ON THE ORDERS OF MAX-MIN FUNCTIONALS
- TREE EXPRESSIONS AND THEIR PRODUCT FORMULA