Pages that link to "Item:Q636005"

The following pages link to Optimal value bounds in nonlinear programming with interval data (Q636005):

Displaying 32 items.

• Some results on the upper bound of optimal values in interval convex quadratic programming (Q268294) (← links)
• A new multi-section based technique for constrained optimization problems with interval-valued objective function (Q275782) (← links)
• A mathematical programming approach to sample coefficient of variation with interval-valued observations (Q286182) (← links)
• Linear bilevel programming with interval coefficients (Q432810) (← links)
• An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming (Q458929) (← links)
• Necessary and sufficient conditions for unified optimality of interval linear program in the general form (Q491109) (← links)
• On interval-valued pseudolinear functions and interval-valued pseudolinear optimization problems (Q492568) (← links)
• \(\chi\)-optimal solution of single objective nonlinear optimization problem with uncertain parameters (Q724378) (← links)
• Solving nonlinear interval optimization problem using stochastic programming technique (Q724398) (← links)
• Interval quadratic programming for day-ahead dispatch of uncertain predicted demand (Q899284) (← links)
• Some properties of the lower bound of optimal values in interval convex quadratic programming (Q1676492) (← links)
• Compromising solution of geometric programming problem with bounded parameters (Q1697901) (← links)
• Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems (Q1706415) (← links)
• Interval convex quadratic programming problems in a general form (Q1788939) (← links)
• Efficient solution of interval optimization problem (Q1935954) (← links)
• An efficient solution of nonlinear enhanced interval optimization problems and its application to portfolio optimization (Q2099941) (← links)
• Optimal value bounds in interval fractional linear programming and revenue efficiency measuring (Q2201303) (← links)
• Solving interval quadratic programming problems by using the numerical method and swarm algorithms (Q2210245) (← links)
• Checking weak and strong optimality of the solution to interval convex quadratic program (Q2244344) (← links)
• A cutting plane method for bilevel linear programming with interval coefficients (Q2259044) (← links)
• New method for computing the upper bound of optimal value in interval quadratic program (Q2349540) (← links)
• Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients (Q2358169) (← links)
• An exact \(l_1\) penalty approach for interval-valued programming problem (Q2361583) (← links)
• Strong optimal solutions of interval linear programming (Q2435407) (← links)
• Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming (Q2435530) (← links)
• Checking weak optimality of the solution to linear programming with interval right-hand side (Q2448199) (← links)
• Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints (Q2511193) (← links)
• MULTI-OBJECTIVE GEOMETRIC PROGRAMMING WITH VARYING PARAMETERS: APPLICATION IN WASTE WATER TREATMENT SYSTEM (Q5011259) (← links)
• (Q5151922) (← links)
• EA solutions and EA solvability to general interval linear systems (Q5860874) (← links)
• Gradient-based descent linesearch to solve interval-valued optimization problems under gH-differentiability with application to finance (Q6073192) (← links)
• Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form (Q6181380) (← links)