Graph algorithm for partially-linear problems obtained by absolute value functions

DOI10.1080/02331939508844147MaRDI QIDQ4859836zbMATH OpenOpenAlexFDO

Authors Chavdar Atanasov Dangalchev

Publication date 7 January 1996

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939508844147

zbMATH Keywords

finite number of linear partspartially-linear models

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)

Recommendations

• Algorithm for solving partially - linear optimization problems obtained by getting maximum of functions
• scientific article; zbMATH DE number 1131737
• Partially-Linear Transportation Problems, Obtained by Means of Absolute Value Functions
• Partially-linear transportation problems
• On programming with absolute value functions

Cited in

(1)

• Partially-Linear Transportation Problems, Obtained by Means of Absolute Value Functions

This page was built for publication: Graph algorithm for partially-linear problems obtained by absolute value functions

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