Duality theory for the matrix linear programming problem
Multiple objective linear programming, also known as the linear vector maximization problem, has been studied by a number of authors. Neither the symmetry nor all the relationships of the duality theory of conventional linear programming, however, have been obtained in previous work. Such results are developed in this paper, which is most directly related to the work of \textit{H. Isermann} [Z. Oper. Res., Ser. A 22, 33-41 (1978; Zbl 0375.90049)], by regarding the variables to the matrices. Previous work on matrix linear programming [see \textit{B. D. Craven} and \textit{B. Mond}, Linear Algebra Appl. 38, 73-80 (1981; Zbl 0464.90052)] has been restricted to a scalar objective function and differs substantially from that presented here.
- Algorithms for the vector maximization problem
- Duality for Multiple Objective Convex Programs
- Duality theory for maximizations with respect to cones
- Dualizing optimization problems in mathematical economics
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Inverse programming and the linear vector maximization problem
- Linear programming with matrix variables
- On some relations between a dual pair of multiple objective linear programs
- Proper efficiency and the theory of vector maximization
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- EP theorem for dual linear complementarity problems
- Weak duality theorem and complementary slackness theorem for linear matrix programming problems
- Multilinear programming: Duality theories
- Vector games with potential function
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization
- Duality of matrix pencils, Wong chains and linearizations
- scientific article; zbMATH DE number 4016619 (Why is no real title available?)
- The duality theorem of linear programming: an intuitive approach
- scientific article; zbMATH DE number 4199475 (Why is no real title available?)
- Matrix Programming with Set-Inclusive Constraints and Objective Set
- Saddle points and scalarizing sets in multiple objective linear programming
- scientific article; zbMATH DE number 519996 (Why is no real title available?)
- Some variations, extensions, and generalizations of Tucker’s theorems
- On duality in multiple objective linear programming
- scientific article; zbMATH DE number 4185394 (Why is no real title available?)
- Nondifferentiable multiobjective second-order symmetric duality
- Relaxations and duality for multiobjective integer programming
- Technical note: Games with vector payoffs
- A review of duality theory for linear programming over topological vector spaces
This page was built for publication: Duality theory for the matrix linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083374)
