scientific article; zbMATH DE number 3325265
From MaRDI portal
Publication:5604205
zbMATH Open0204.49404MaRDI QIDQ5604205FDOQ5604205
Authors: B. MacHost 
Publication date: 1970
Title of this publication is not available (Why is that?)
Cited In (14)
- An improved three-step method for solving the interval linear programming problems
- Rigorous solution of linear programming problems with uncertain data
- Monte Carlo simulation for computing the worst value of the objective function in the interval linear programming
- Duality gap in interval linear programming
- Interval analytic treatment of convex programming problems
- Optimal value range in interval linear programming
- A cutting plane method for bilevel linear programming with interval coefficients
- Complexity issues in interval linear programming
- How to determine basis stability in interval linear programming
- Linear programming sensitivity measured by the optimal value worst-case analysis
- AE solutions and AE solvability to general interval linear systems
- Inverse linear programming with interval coefficients
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
- On the optimal solution set in interval linear programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5604205)
