A linear max—min problem
From MaRDI portal
Cites work
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- Convex Analysis
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- scientific article; zbMATH DE number 3326198 (Why is no real title available?)
- Sur les inégalités linéaires
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
Cited in
(45)- Duality for nonconvex absolute value programming and a characterization of linear max-min programs
- Geometric and algorithmic developments for a hierarchical planning problem
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- A note on the solution of bilinear programming problems by reduction to concave minimization
- Hierarchical optimization: An introduction
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- The complementary convex structure in global optimization
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- A linear programming approach to solving bilinear programmes
- Generalized bilinear programming: An application in farm management
- The maximization of a function over the efficient set via a penalty function approach
- A quasiconcave minimization method for solving linear two-level programs
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A 2-person game on a polyhedral set of connected strategies
- Links between linear bilevel and mixed 0-1 programming problems
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
- An algebra-based approach for linearly constrained concave minimization
- Linear bilevel programming solution by genetic algorithm
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
- Bilevel linear programming
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables
- Goal programming to model human decision making in ultimatum games
- On a stochastic bilevel programming problem
- Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems
- A method for solving bilevel linear programming problems
- A simple algorithm for the-linear bilevel programming problem
- A cutting plane algorithm for solving bilinear programs
- Maximization of A convex quadratic function under linear constraints
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Robust location transportation problems under uncertain demands
- A new method to solve bi-level quadratic linear fractional programming problems
- On engineering game theory with its application in power systems
- A linear bilevel programming algorithm based on bicriteria programming
- Interval Markov Decision Processes with Continuous Action-Spaces
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- Algorithm for solving the problem of the first phase in a game problem with arbitrary situations
- A robust optimization approach for repairing and overhauling in a captive repair shop under uncertainty
- Search for locally optimal strategies in a linear game problem with favorable situations
- Engineering game theory: mathematical principles and applications in power systems
- Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
- Jointly constrained bilinear programs and related problems: An overview
- Global maximization of a generalized concave multiplicative function
This page was built for publication: A linear max—min problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401743)
