Pages that link to "Item:Q1218343"
From MaRDI portal
The following pages link to Infinitely constrained optimization problems (Q1218343):
Displaying 50 items.
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models (Q261002) (← links)
- Robust international portfolio management (Q373171) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- Uses and computation of imprecise probabilities from statistical data and expert arguments (Q505254) (← links)
- Min-max-min robust combinatorial optimization (Q526823) (← links)
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521) (← links)
- Almost robust discrete optimization (Q666949) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Inexact linear programming with generalized technological matrix sets (Q788633) (← links)
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
- Towards global bilevel dynamic optimization (Q842715) (← links)
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems (Q896176) (← links)
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints (Q901119) (← links)
- A parallel algorithm for semi-infinite programming (Q956770) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- An algorithm for the global optimization of a class of continuous minimax problems (Q1028590) (← links)
- Multiple objective programming problems with possibilistic coefficients (Q1090630) (← links)
- Fuzzy optimization: An appraisal (Q1123820) (← links)
- A cutting-plane algorithm with linear and geometric rates of convergence (Q1147491) (← links)
- A new solution to optimization-satisfaction problems by a penalty method (Q1156353) (← links)
- Computer-aided design via optimization: A review (Q1161482) (← links)
- Generalized Farkas' theorem and optimization of infinitely constrained problems (Q1169404) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- Implicitly defined optimization problems (Q1184525) (← links)
- Production and marketing decisions with multiple objectives in a competitive environment (Q1235631) (← links)
- An outer approximations algorithm for computer-aided design problems (Q1250031) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- Optimal deviations from an asset allocation. (Q1422358) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
- A direct method of linearization for continuous minimax problems (Q1821697) (← links)
- Multilevel flow control in telecommunication networks (Q1894564) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
- \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination (Q2256741) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems (Q2276890) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
- Necessity measure optimization in linear programming problems with fuzzy polytopes (Q2455529) (← links)
- A transformation-based discretization method for solving general semi-infinite optimization problems (Q2661756) (← links)
- Multistage Adaptive Robust Optimization for the Unit Commitment Problem (Q2806056) (← links)
- Lower level duality and the global solution of generalized semi-infinite programs (Q2810114) (← links)
- Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137) (← links)
- Towards rigorous robust optimal control via generalized high-order moment expansion (Q3176438) (← links)
