Constrained Entropy Models; Solvability and Sensitivity

DOI10.1287/mnsc.25.6.555zbMath0423.90075OpenAlexW2092221261MaRDI QIDQ3858051

Gary A. Kochenberger, John J. Dinkel

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.6.555

zbMATH Keywords

sensitivity analysissolvabilityduality theorygeometric programmingconstrained entropy maximization modeltrip distribution problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Measures of information, entropy (94A17)

Related Items

A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem ⋮ A branch and bound network approach to the canonical constrained entropy problem ⋮ Sensitivity analysis in geometric programming ⋮ Sensitivity analysis in geometric programming: Theory and computations

This page was built for publication: Constrained Entropy Models; Solvability and Sensitivity