Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem

DOI10.1007/s00186-006-0095-zzbMath1114.90109OpenAlexW1978478096MaRDI QIDQ857834

N. E. Zubov

Publication date: 5 January 2007

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.trinity.edu/cgi/viewcontent.cgi?article=1040&context=math_faculty

zbMATH Keywords

Computational economicsAsymptotic programmingMultiple-objective linear programmingNonsubstitution theoremSign-solvability

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Economics of information (91B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning multiple objective optimal solutions with applications in radiotherapy design
• Convergence of interval-type algorithms for generalized fractional programming
• Asymptotic linear programming and policy improvement for singularly perturbed Markov decision processes
• Multicriteria optimization
• The asymptotic optimal partition and extensions of the nonsubstitution theorem
• Linear programs dependent on a single parameter
• Analytic centers and repelling inequalities
• A canonical form for pencils of matrices with applications to asymptotic linear programs
• An efficient basis update for asymptotic linear programming
• The Samuelson Nonsubstitution Theorem and the Computation of Equilibrium Prices
• A Simple Proof of the Nonsubstitution Theorem
• Asymptotic Linear Programming
• The Dynamic Nonsubstitution Theorem

This page was built for publication: Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem