scientific article; zbMATH DE number 3858877

MaRDI QIDQ3328308zbMATH OpenFDO

Authors Mihaly Dormany

Publication date 1983

zbMATH Keywords

bounded convex polyhedral domaindual-parametric linear programmingmultiple objective programmingsimplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• scientific article; zbMATH DE number 13840
• scientific article; zbMATH DE number 3950226
• scientific article; zbMATH DE number 592650
• An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
• A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem

Cited in

(6)

• Numerical analysis of algorithms for solving bicriteria discrete programming problems
• Bi-criteria optimization problems for decision rules
• scientific article; zbMATH DE number 3950226 (Why is no real title available?)
• Applied Bi-objective programs
• scientific article; zbMATH DE number 13840 (Why is no real title available?)
• On the Structure of the Non-dominated Set for Bicriteria Programmes

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 Q3328308)