A variable transformation method for solving linear absolute-value objective-function problems with linear constraints
From MaRDI portal
(Redirected from Publication:1095607)
Using the well-known simplex algorithm a variable transformation method is derived to solve the linear absolute-value objective-function problem with linear constraints. From the numerical point of view it is known that this method is not the best one.
Recommendations
- The transformation technique for a class of variable upper bounding constraints in linear programming
- Transformed function method for global optimization with linear constraints
- An augmented Lagrangian approach with a variable transformation in nonlinear programming
- An approach to finding trade-off solutions by a linear transformation of objective functions
- A solution method for linear variational relation problems
- Transformation and restructuring of linear multiobjective programs: A fundamental method to resolve complex problems
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- scientific article; zbMATH DE number 822149
- A method of solving nonlinear variational problems by nonlinear transformation of the objective functional. II
- Publication:4937580
Cites work
Cited in
(5)- The transformation technique for a class of variable upper bounding constraints in linear programming
- On programming with absolute value functions
- Capability analysis of the variable measurement system with fuzzy data
- scientific article; zbMATH DE number 3939110 (Why is no real title available?)
- Contrasting two transformation-based methods for obtaining absolute extrema
This page was built for publication: A variable transformation method for solving linear absolute-value objective-function problems with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095607)