scientific article; zbMATH DE number 4199967

MaRDI QIDQ3348703zbMATH OpenFDO

Authors Huu-Nhon Huynh, Santosh Kumar

Publication date 1990

zbMATH Keywords

extreme point mathematical programmingrandom search

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05) Multi-objective and goal programming (90C29)

Recommendations

• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
• Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
• A branch and bound algorithm for extreme point mathematical programming problems
• A finite procedure to generate feasible points for the extreme point mathematical programming problem
• Use of random search in solving discrete extremal problems
• scientific article; zbMATH DE number 4216294
• Random search method for solving series of linear programming problems
• scientific article; zbMATH DE number 4108054
• An exterior-point method for linear programming problems
• Extragradient methods for searching for equilibrium points in the parametric problem of equilibrium programming

Cited in

(7)

• A branch and bound algorithm for extreme point mathematical programming problems
• Use of random search in solving discrete extremal problems
• scientific article; zbMATH DE number 4216294 (Why is no real title available?)
• A new random group search algorithm for solving the multi-objective programming problems
• scientific article; zbMATH DE number 4031398 (Why is no real title available?)
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
• A primal like algorithm for extreme point fuzzy mathematical programming problem

This page was built for publication:

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