Entropy in linear programs

DOI10.1007/BF01584236MaRDI QIDQ3911662zbMATH OpenFDO

Authors Sven Erlander

Publication date 1981

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

sensitivitydualitymaximum entropyNewton-Kantorovich methodchemical equilibriumconditions for uniquenessLagrange-multipliersminimum informationentropy constrained linear programslocally convergent iterative procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Measures of information, entropy (94A17) Mathematical programming (90C99)

Cites work

• scientific article; zbMATH DE number 3143969 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3545352 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3311499 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A Mathematical Theory of Communication
• A note on solution of large sparse maximum entropy problems with linear equality constraints
• An analysis of economic size distributions
• Entropy in linear programs
• Generalized Iterative Scaling for Log-Linear Models
• Information Theory and Statistical Mechanics
• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
• Optimal spatial interaction and the gravity model

Cited in

(28)

• New class of multiplicative algorithms for solving of entropy-linear programs
• Multiple objective decision-making in the mode choice problem: A goal-programming approach
• On scaling linear programs—some experimental results
• Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
• Enhanced computation of the proximity operator for perspective functions
• A proximal method with logarithmic barrier for nonlinear complementarity problems
• Implementation of an inexact approach to solving linear semi-infinite programming problems
• An unconstrained convex programming approach to solving convex quadratic programming problems
• A non-linear goal programming model and solution method for the multi-objective trip distribution problem in transportation engineering
• The primal-dual algorithm as a constraint-set-manipulation device
• An algorithm for maximum entropy image reconstruction from noisy data
• An unconstrained convex programming view of linear programming
• On Block-Iterative Entropy Maximization
• Linear programming with entropic perturbation
• Asymptotic analysis of the exponential penalty trajectory in linear programming
• Optimization of Burg's entropy over linear constraints
• Deriving an unconstrained convex program for linear programming
• An inexact approach to solving linear semi-infinite programming problems
• Proximal Methods with Penalization Effects in Banach Spaces
• Entropic approach to interior point solution of linear programs
• On the duality of the mixed entropy programming
• On duality for entropy constrained programs
• A long range forestry planning problem with multiple objectives
• Discrete-time optimal control of an economic system using different objective functions
• Entropy and set covering
• Conditional clusters, musters, and probability
• Entropy in linear programs
• On some optimization techniques in image reconstruction from projections

This page was built for publication: Entropy in linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3911662)