The following pages link to A linear max—min problem (Q4401743):
Displaying 42 items.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Robust location transportation problems under uncertain demands (Q496635) (← links)
- A linear bilevel programming algorithm based on bicriteria programming (Q581254) (← links)
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model (Q757251) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- Duality for nonconvex absolute value programming and a characterization of linear max-min programs (Q1058980) (← links)
- Geometric and algorithmic developments for a hierarchical planning problem (Q1063518) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
- Hierarchical optimization: An introduction (Q1184516) (← links)
- Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
- The complementary convex structure in global optimization (Q1187368) (← links)
- Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
- A linear programming approach to solving bilinear programmes (Q1207310) (← links)
- Generalized bilinear programming: An application in farm management (Q1266521) (← links)
- The maximization of a function over the efficient set via a penalty function approach (Q1278284) (← links)
- A quasiconcave minimization method for solving linear two-level programs (Q1318264) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- A 2-person game on a polyhedral set of connected strategies (Q1356874) (← links)
- Links between linear bilevel and mixed 0-1 programming problems (Q1379953) (← links)
- New necessary and sufficient optimality conditions for strong bilevel programming problems (Q1702864) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- An algebra-based approach for linearly constrained concave minimization (Q1876470) (← links)
- Linear bilevel programming solution by genetic algorithm (Q1941961) (← links)
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296) (← links)
- Bilevel linear programming (Q2368110) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
- Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables (Q2470333) (← links)
- Goal programming to model human decision making in ultimatum games (Q2865179) (← links)
- On a stochastic bilevel programming problem (Q2892149) (← links)
- Existence of solutions to weak nonlinear bilevel problems<i>via</i>MinSup and d.c. problems (Q3539802) (← links)
- A method for solving bilevel linear programming problems (Q3602259) (← links)
- A simple algorithm for the-linear bilevel programming problem (Q3773715) (← links)
- A cutting plane algorithm for solving bilinear programs (Q4124613) (← links)
- Maximization of A convex quadratic function under linear constraints (Q4127644) (← links)
- A New Method To Solve Bi-Level Quadratic Linear Fractional Programming Problems (Q5251689) (← links)
- On engineering game theory with its application in power systems (Q5367955) (← links)
- Algorithm for solving the problem of the first phase in a game problem with arbitrary situations (Q6572949) (← links)
- A robust optimization approach for repairing and overhauling in a captive repair shop under uncertainty (Q6613981) (← links)
