On an inverse linear programming problem

DOI10.1134/S0081543816090030zbMath1398.90094MaRDI QIDQ2396367

A. I. Golikov, G. A. Amirkhanova, Yuri G. Evtushenko

Publication date: 8 June 2017

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationlinear programmingdualitygeneralized Newton methodinverse linear programming problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)

Related Items (3)

Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems ⋮ Inverse optimization approach to the identification of electricity consumer models ⋮ Regularization and Matrix Correction of Improper Linear Programming Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experience in organizing hybrid parallel calculations in the Evtushenko-Golikov method for problems with block-angular structure
• Generalized Newton method for linear optimization problems with inequality constraints
• A Newton method for linear programming
• A further study on inverse linear programming problems
• On the minimum norm solution of linear programs
• Search for normal solutions in linear programming problems
• Calculating some inverse linear programming problems
• Dual approach to the application of barrier functions for the optimal correction of improper linear programming problems of the first kind
• Inverse Optimization
• Parallel implementation of Newton’s method for solving large-scale linear programs
• A finite newton method for classification
• Quadratic approximation of penalty functions for solving large-scale linear programs

This page was built for publication: On an inverse linear programming problem