Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems (Q4888171)

From MaRDI portal
Revision as of 21:41, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 909742
Language Label Description Also known as
English
Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems
scientific article; zbMATH DE number 909742

    Statements

    Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems (English)
    0 references
    0 references
    0 references
    0 references
    6 January 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    transportation problems
    0 references
    unconstrained convex programming dual approach
    0 references
    linearly-constrained entropy maximization
    0 references
    quadratic cost
    0 references
    Lagrangian dual
    0 references
    quadratic rate of convergence
    0 references
    0 references