OpenAlex
PricingAboutJobs
Log inGet started
Work

Extending the Fundamental Theorem of Linear Programming for Strict Inequalities

HTML

Year: 2021
Type: conference-paper
Source: International Symposium on Symbolic and Algebraic Computation
Parent work: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation
DOI: 10.1145/3452143.3465538
Authors: Jasper Nalbach, Erika Ábrahám, Gereon Kremer
Institutions: RWTH Aachen University, Stanford University
Language: English

Topic: Advanced Optimization Algorithms Research
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Keywords: strict inequalities, linear programming duality, inequality constraints

Open Access status: closed
OpenAlex ID: W3180033180
FWCI: 0.519
Cites: 26
Cited by: 5
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security