The Direct Power of Adjacent Vertex Programming Methods

DOI10.1287/MNSC.12.3.241zbMath0142.17002OpenAlexW2100932117MaRDI QIDQ5517443

Bela Martos

Publication date: 1965

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.12.3.241

zbMATH Keywords

operations research

Related Items (40)

A new look at fractional programming ⋮ Continuity of Optimal Solution Functions and their Conditions on Objective Functions ⋮ Using convex envelopes to solve the interactive fixed-charge linear programming problem ⋮ On the structure and properties of a linear multilevel programming problem ⋮ Maximization of the transmission rate of a discrete, constant channel ⋮ The application of generalized Benders decomposition to certain nonconcave programs ⋮ Equivalent definitions of the quasiconvexity ⋮ A note on solving multi-objective integer indefinite quadratic fractional programs ⋮ On duality in linear fractional functionals programming ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Quasiconcave functions over chains^† ⋮ A note on fractional interval programming ⋮ Ordinally Quasiconcave Functions^§ ⋮ Nine kinds of quasiconcavity and concavity ⋮ Transportation technique in non-linear fractional programming ⋮ A note on maximization of the transmission rate of discrete, constant channel ⋮ Bilevel problems over polyhedra with extreme point optimal solutions ⋮ On pseudolinear functions ⋮ Fractional programming ⋮ AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS ⋮ On Maximizing a Sum of Ratios ⋮ A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case ⋮ A note on the maximum of quasiconvace functions ⋮ Minimization of ratios ⋮ Lexicographic quasiconcave multiobjective programming ⋮ A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron ⋮ C-programming and the minimization of pseudolinear and additive concave functions ⋮ Goal programming and multiple objective optimizations. Part I ⋮ Strictly quasi-convex (concave) functions and duality in mathematical programming ⋮ On the structure of the weakly efficient set for quasiconvex vector minimization ⋮ Analysis of the solution to a linear fractional functionals programming ⋮ Dynamic lot-sizing with setup cost reduction ⋮ Indefinite quadratic fractional functional programming ⋮ Equivalence of various linearization algorithms for linear fractional programming ⋮ Indefinite Quadratic Solid Transportation Problem ⋮ A chance constrained approach to fractional programming with random numerator ⋮ Local maximum points of explicitly quasiconvex functions ⋮ A dual non-linear program ⋮ A primal-like algorithm for zero-one integer Fractional Programming Problem ⋮ Bibliography in fractional programming

This page was built for publication: The Direct Power of Adjacent Vertex Programming Methods