Finding a solution of a class of multi-objective programming problems

MaRDI QIDQ2815747zbMATH OpenFDO

Authors Qingqing Liu, Xiaohui Qian

Publication date 30 June 2016

Published in International Journal of Applied Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL http://www.ceser.in/ceserp/index.php/ijamas/article/view/1682

zbMATH Keywords

constructive proofmulti-objective programming problemsunbounded regions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• scientific article; zbMATH DE number 7234885
• A noninterior path following algorithm for solving a class of multiobjective programming problems
• A homotopy method for multiobjective programming problems
• Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
• scientific article; zbMATH DE number 3936958

Cited in

(6)

• A noninterior path following algorithm for solving a class of multiobjective programming problems
• Programming Problems with a Large Number of Objective Functions
• Clasification en programacion multiobjetivo
• scientific article; zbMATH DE number 721839 (Why is no real title available?)
• scientific article; zbMATH DE number 1160625 (Why is no real title available?)
• General method for solving multi-objective de novo programming problem

This page was built for publication: Finding a solution of a class of multi-objective programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815747)