Pages that link to "Item:Q5891086"
From MaRDI portal
The following pages link to Linear programming. Foundations and extensions (Q5891086):
Displaying 34 items.
- Injective convex polyhedra (Q331374) (← links)
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
- Efficient optimization of the reward-risk ratio with polyhedral risk measures (Q684143) (← links)
- Linear programming: foundations and extensions (Q1352549) (← links)
- Significance testing in non-sparse high-dimensional linear models (Q1616315) (← links)
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization (Q1680765) (← links)
- A hybrid simulated annealing/linear programming approach for the cover printing problem (Q1721187) (← links)
- An extension of the fundamental theorem of linear programming (Q1866989) (← links)
- Multiple criteria decision-making based on vector similarity measures under the framework of dual hesitant fuzzy sets (Q2004159) (← links)
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models (Q2239936) (← links)
- The multilinear model in multicriteria decision making: the case of 2-additive capacities and contributions to parameter identification (Q2286882) (← links)
- A simplex-type algorithm for continuous linear programs with constant coefficients (Q2297646) (← links)
- POD-based mixed-integer optimal control of the heat equation (Q2333685) (← links)
- Linear and nonlinear programming (Q2354092) (← links)
- Linear programming. Foundations and extensions. (Q2473785) (← links)
- On the existence of a short pivoting sequence for a linear program (Q2661547) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- (Q3763895) (← links)
- (Q4225802) (← links)
- Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods (Q4685835) (← links)
- (Q4799938) (← links)
- POINTWISE RESIDUAL METHOD FOR SOLVING PRIMAL AND DUAL ILL-POSED LINEAR PROGRAMMING PROBLEMS WITH APPROXIMATE DATA (Q4983567) (← links)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
- (Q5091983) (← links)
- Beyond p-Boxes and Interval-Valued Moments: Natural Next Approximations to General Imprecise Probabilities (Q5126377) (← links)
- ON MARINE LIABILITY PORTFOLIO MODELING (Q5213439) (← links)
- Linear programming. Foundations and extensions (Q5906270) (← links)
- Linear programming. Foundations and extensions (Q5919463) (← links)
- Linear programming. Foundations and extensions (Q5946779) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- A framework of distributionally robust possibilistic optimization (Q6570732) (← links)