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

Authors

188

  1. KT
    Kalyan Talluri

    Universitat Pompeu Fabra, Spain

    9 publications · 344 citations

    9

    h-index

  2. SK
    Sumit Kunnumkal

    Indian School of Business, India

    7 publications · 279 citations

    7

    h-index

  3. HT
    Hüseyin Topaloğlu

    Cornell University, United States

    6 publications · 410 citations

    6

    h-index

  4. AC
    A. Charnes

    The University of Texas at Austin, United States

    4 publications · 1.2K citations

    4

    h-index

  5. WW
    W. W. Cooper

    The University of Texas at Austin, United States

    3 publications · 1.2K citations

    3

    h-index

1–5 of 188

Venues

  1. Operations Research

    14 publications · 3K citations

    13

    h-index

  2. Transportation Science

    6 publications · 435 citations

    6

    h-index

  3. Production and Operations Management

    POMS · 4 publications · 184 citations

    4

    h-index

  4. European Journal of Operational Research

    3 publications · 328 citations

    3

    h-index

  5. Management Science

    3 publications · 151 citations

    3

    h-index

1–5