A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A noninterior path following algorithm for solving a class of multiobjective programming problems |
scientific article; zbMATH DE number 7017394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A noninterior path following algorithm for solving a class of multiobjective programming problems |
scientific article; zbMATH DE number 7017394 |
Statements
A noninterior path following algorithm for solving a class of multiobjective programming problems (English)
0 references
8 February 2019
0 references
Summary: Multiobjective programming problems have been widely applied to various engineering areas which include optimal design of an automotive engine, economics, and military strategies. In this paper, we propose a noninterior path following algorithm to solve a class of multiobjective programming problems. Under suitable conditions, a smooth path will be proven to exist. This can give a constructive proof of the existence of solutions and lead to an implementable globally convergent algorithm. Several numerical examples are given to illustrate the results of this paper.
0 references
0 references
0 references
0 references
0 references
0 references
0.7853979468345642
0 references
0.774900496006012
0 references
