Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
type: Item
instance of: scholarly article
title: Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
zbMATH Open document ID: 0959.90042
author: Dinh The Luc
author: Nguyen Thi Bach Kim
published in: Acta Mathematica Vietnamica
publication date: 2001-05-06T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1495993
zbMATH Keywords: normal cones
zbMATH Keywords: polyhedral convex set
zbMATH Keywords: optimality conditions
zbMATH Keywords: linear multiobjective programming problem
MaRDI profile type: Publication
Recommended article: Normal conical algorithm for concave minimization over polytopes
Recommended article: Introducing Nonpolyhedral Cones to Multiobjective Programming
Recommended article: Normal cone method in solving linear multiobjective problems
Recommended article: Q5202836
Recommended article: Q3468877
Recommended article: Q4514771
Recommended article: Q5277147
Recommended article: Concave programming for minimizing the zero-norm over polyhedral sets
Recommended article: Generating efficient faces for multiobjective linear programming problems
Recommended article: An exterior point linear programming method based on inclusive normal cones
description: scientific article; zbMATH DE number 1495993