Pages that link to "Item:Q1424784"
From MaRDI portal
The following pages link to On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals (Q1424784):
Displaying 24 items.
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
- A conic relaxation model for searching for the global optimum of network data envelopment analysis (Q2272317) (← links)
- Convex envelope of bivariate cubic functions over rectangular regions (Q2301177) (← links)
- Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Global optimization for sum of linear ratios problem with coefficients (Q2493767) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- Concave envelopes of monomial functions over rectangles (Q3156733) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)
