Deterministic Linear Programming
Deterministic Linear Programming is a mathematical optimization method that belongs to the class of linear programming techniques, distinguished by its assumption of certainty in parameters and constraints, enabling the derivation of exact solutions for resource allocation, scheduling, or design problems.
106
Publications
7.9K
Citations
188
Authors
109
Institutions
Publications per year
2017–2026
16
Parents
106
A Bank Asset and Liability Management Model
Martin Kusý, William T. Ziemba · Operations Research · 1986 · 319 citations · Full text
Management, Finance, Risk Management +16
1–5 of 106
188
9
h-index
7
h-index
6
h-index
4
h-index
3
h-index
1–5 of 188
109
Indian School of Business
Hyderabad, India
7 h-index
7 publications
279 citations

Cornell University
Ithaca, United States
6 h-index
6 publications
410 citations
Columbia University
New York, United States
6 h-index
8 publications
1.2K citations
University of Michigan
Ann Arbor, United States
5 h-index
7 publications
1.2K citations
University of Chicago
Chicago, United States
4 h-index
4 publications
533 citations

Imperial College London
London, United Kingdom
4 h-index
4 publications
56 citations

Universitat Pompeu Fabra
Barcelona, Spain
4 h-index
4 publications
276 citations
Northwestern University
Evanston, United States
3 h-index
5 publications
1.1K citations
1–8 of 109
14 publications · 3K citations
13
h-index
6 publications · 435 citations
6
h-index
POMS · 4 publications · 184 citations
4
h-index
3 publications · 328 citations
3
h-index
3 publications · 151 citations
3
h-index
1–5