Branch-and-bound algorithms for solving a modified consumer problem

DOI10.23952/COT.2022.14MaRDI QIDQ7000854zbMATH OpenFDO

Authors Le Dung Muu, Nguyen V. Quy

Publication date 7 April 2025

Published in Communications in Optimization Theory (Search for Journal in Brave)

zbMATH Keywords

envelope functionbilinear constraintconsumer problemadaptive simplexdecoupling relaxationrectangular bisection

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Consumer behavior, demand theory (91B42)

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 3490676 (Why is no real title available?)
• An algorithm for solving convex programs with an additional convex- concave constraint
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs
• Convex analysis and global optimization
• Convex-concave programming as a decomposition approach to global optimization
• Mathematical optimization and economic theory
• Method for minimizing a convex-concave function over a convex set
• Revisiting the problem of integrability in utility theory
• Variational analysis for the consumer theory

This page was built for publication: Branch-and-bound algorithms for solving a modified consumer problem

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