Iterative methods for large-scale problems
From MaRDI portal
Cites work
- A boundary-point LP solution method and its application to dense linear programs
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Algorithm for solution of linear quadratic optimization problem with constraint in the form of equalities on control
- An exterior point simplex algorithm for (general) linear programming problems
- Decomposition Principle for Linear Programs
- Effective trajectories of economic dynamics models on graphs
- scientific article; zbMATH DE number 3864992 (Why is no real title available?)
- scientific article; zbMATH DE number 3956890 (Why is no real title available?)
- scientific article; zbMATH DE number 3771369 (Why is no real title available?)
- scientific article; zbMATH DE number 3782733 (Why is no real title available?)
- scientific article; zbMATH DE number 3545267 (Why is no real title available?)
- scientific article; zbMATH DE number 3398346 (Why is no real title available?)
- Lie symmetry analysis for Kawahara-KdV equations
- Linear programming. Foundations and extensions
- Maximum entropy-based method for extracting the underlying probability distributions of Z-number
- Multiple Objective Linear Fractional Programming
- Preface of the special issue: Control, teams, and games
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Robust reduction of a class of large-scale linear programs
- Solving Bicriterion Mathematical Programs
- Stability in multicriteria optimization
- Stability of nondominated solutions in multicriteria decision-making
- The Decomposition Algorithm for Linear Programs
- Two direct methods in linear programming
This page was built for publication: Iterative methods for large-scale problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7301866)