Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
From MaRDI portal
Recommendations
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- Strong optimal solutions of interval linear programming
- On strong optimality of interval linear programming
- Checking weak optimality and strong boundedness in interval linear programming
- Necessary and sufficient conditions for unified optimality of interval linear program in the general form
Cites work
- scientific article; zbMATH DE number 1784659 (Why is no real title available?)
- A general method for enclosing solutions of interval linear equations
- A new technique in systems analysis under interval uncertainty and ambiguity
- A numerical solution method to interval quadratic programming
- Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
- An interval nonlinear program for the planning of waste management systems with economies-of-scale effects -- a case study for the region of Hamilton, Ontario, Canada
- Explicit description of \(AE\) solution sets for parametric linear systems
- Fault detection in discrete dynamic systems with uncertainty based on interval optimization
- Linear Optimization Problems with Inexact Data
- Linear programming with interval coefficients
- Localized solutions to interval linear equations
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- Numerical solution method for general interval quadratic programming
- Optimal and strongly optimal solutions for linear programming models with variable parameters
- Optimal value bounds in nonlinear programming with interval data
- Optimal value range in interval linear programming
- Outer enclosures to the parametric \(AE\) solution set
- Satisficing solutions and duality in interval and fuzzy linear programming
- Strong optimal solutions of interval linear programming
- Strong solvability of interval linear programming problems
- Systems of linear interval equations
- The optimal solution set of the interval linear programming problems
- Weak and strong solvability of interval linear systems of equations and inequalities
Cited in
(23)- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- AE solutions to two-sided interval linear systems over max-plus algebra
- EA solutions and EA solvability to general interval linear systems
- AE solutions to interval linear systems over max-plus algebra
- Interval convex quadratic programming problems in a general form
- Note on ``A new equivalent transformation for interval inequality constraints of interval linear programming
- Checking weak and strong optimality of the solution to interval convex quadratic program
- The best, the worst and the semi-strong: optimal values in interval linear programming
- Checking weak optimality of the solution to interval linear program in the general form
- scientific article; zbMATH DE number 3880020 (Why is no real title available?)
- Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form
- Robust optimal solutions in interval linear programming with forall-exists quantifiers
- Strong optimal solutions of interval linear programming
- Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients
- Farkas-type conditions of general interval linear systems for AE solvability
- AE solutions and AE solvability to general interval linear systems
- Necessary and sufficient conditions for unified optimality of interval linear program in the general form
- On interval-valued pseudolinear functions and interval-valued pseudolinear optimization problems
- Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
- Checking weak optimality and strong boundedness in interval linear programming
- On strong optimality of interval linear programming
- Strong solvability of restricted interval systems and its applications in quadratic and geometric programming
This page was built for publication: Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2511193)