Inverse Quadratic Transportation Problem
Abstract
Many research has been conducted about quadratic programming and inverse optimization. In this paper we present the combination aspect of these subjects, applying on transportation problem. First, we obtain the inverse form of quadratic tranportation problem under L1 norm by using duality as well as introducing the optimal value. Then, we do the same process for inverse quadratic transportation problem (IQTP) under L∞ norm.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.