Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form (Q6181380): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear programming with interval coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Description of <i>AE</i> Solution Sets for Parametric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Optimization Problems with Inexact Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear interval inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvability and feasibility of interval linear equations and inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5371397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal value bounds in nonlinear programming with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak and strong solvability of interval linear systems of equations and inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval convex quadratic programming problems in a general form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong optimality of interval linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: New method for computing the upper bound of optimal value in interval quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the upper bound of optimal values in interval convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of the lower bound of optimal values in interval convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking weak optimality of the solution to linear programming with interval right-hand side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong optimal solutions of interval linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking weak and strong optimality of the solution to interval convex quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4648727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution set characterization of linear interval systems with a specific dependence structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on dependency between interval linear systems / rank
 
Normal rank

Latest revision as of 19:25, 23 August 2024

scientific article; zbMATH DE number 7792597
Language Label Description Also known as
English
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form
scientific article; zbMATH DE number 7792597

    Statements

    Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form (English)
    0 references
    0 references
    0 references
    0 references
    22 January 2024
    0 references
    interval convex quadratic program
    0 references
    weakly optimal solution
    0 references
    strongly optimal solution
    0 references
    feasible directions
    0 references
    0 references
    0 references

    Identifiers