A linear max—min problem
From MaRDI portal
Publication:4401743
DOI10.1007/BF01580119zbMath0276.90053MaRDI QIDQ4401743
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
An algebra-based approach for linearly constrained concave minimization, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, On a stochastic bilevel programming problem, Bilevel linear programming, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, A note on the solution of bilinear programming problems by reduction to concave minimization, A 2-person game on a polyhedral set of connected strategies, Links between linear bilevel and mixed 0-1 programming problems, A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent, A simple algorithm for the-linear bilevel programming problem, Linear bilevel programming solution by genetic algorithm, Interval Markov Decision Processes with Continuous Action-Spaces, New necessary and sufficient optimality conditions for strong bilevel programming problems, On engineering game theory with its application in power systems, Jointly constrained bilinear programs and related problems: An overview, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Global optimization for generalized linear multiplicative programming using convex relaxation, Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems, Global maximization of a generalized concave multiplicative function, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, Hierarchical optimization: An introduction, Efficient algorithms for solving rank two and rank three bilinear programming problems, Robust location transportation problems under uncertain demands, The complementary convex structure in global optimization, Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables, Generalized bilinear programming. I: Models, applications and linear programming relaxation, A linear programming approach to solving bilinear programmes, A cutting plane algorithm for solving bilinear programs, Maximization of A convex quadratic function under linear constraints, A linear bilevel programming algorithm based on bicriteria programming, A method for solving bilevel linear programming problems, Generalized bilinear programming: An application in farm management, Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model, The maximization of a function over the efficient set via a penalty function approach, A New Method To Solve Bi-Level Quadratic Linear Fractional Programming Problems, Duality for nonconvex absolute value programming and a characterization of linear max-min programs, Goal programming to model human decision making in ultimatum games, Geometric and algorithmic developments for a hierarchical planning problem, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, A quasiconcave minimization method for solving linear two-level programs
Cites Work
