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

DOI10.1080/02522667.1996.10699279zbMath0873.90067OpenAlexW1969983752MaRDI QIDQ4344275

No author found.

Publication date: 15 July 1997

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

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

zbMATH Keywords

theorems of the alternative

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Duality theory for the matrix linear programming problem
• Continuous time matrix programming
• A class of continuous linear programming problems
• Continuous programming. I: Linear objectives
• Linear Inequalities and Related Systems. (AM-38)
• Matrix Programming with Set-Inclusive Constraints and Objective Set
• Continuous-time Programming
• A Duality Theorem for a Class of Continuous Linear Programming Problems

This page was built for publication: Some variations, extensions, and generalizations of Tucker’s theorems