On boundness of feasible domain of the linear programming problem in the standard form.

zbMATH Open1058.90512MaRDI QIDQ2736650FDOQ2736650

Authors: Cristian Niculescu 

Publication date: 11 September 2001

Published in: Analele Universității București. Matematică (Search for Journal in Brave)

zbMATH Keywords

linear programmingfeasible domain

Mathematics Subject Classification ID

Linear programming (90C05) Fractional programming (90C32) Nonlinear programming (90C30)

This page was built for publication: On boundness of feasible domain of the linear programming problem in the standard form.

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