Matrix Programming with Set-Inclusive Constraints and Objective Set

DOI10.1080/02522667.1991.10699073zbMath0733.90054OpenAlexW1984655206MaRDI QIDQ3360669

Chanchal Singh

Publication date: 1991

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

complementary slacknessWeak and strong duality relations

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

Some variations, extensions, and generalizations of Tucker’s theorems

Cites Work

• Duality in inexact fractional programming with set-inclusive constraints
• Duality theory for the matrix linear programming problem
• Convex programming with set-inclusive contraints and its applications to generalized linear and fractional programming
• Continuous time programming with set-inclusive constraints and objective set
• Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Erratum

This page was built for publication: Matrix Programming with Set-Inclusive Constraints and Objective Set