Pages that link to "Item:Q5560788"
From MaRDI portal
The following pages link to Solving Bicriterion Mathematical Programs (Q5560788):
Displaying 50 items.
- Budget-constrained minimum cost flows (Q281825) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- C-programming and the minimization of pseudolinear and additive concave functions (Q579142) (← links)
- Robust portfolio optimization with a generalized expected utility model under ambiguity (Q665830) (← links)
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859) (← links)
- An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
- Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
- The biobjective undirected two-commodity minimum cost flow problem (Q707093) (← links)
- A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- Multiple objective minimum cost flow problems: a review (Q853016) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- A new global optimization approach for convex multiplicative programming (Q972168) (← links)
- Partitioning multiple objective optimal solutions with applications in radiotherapy design (Q1027150) (← links)
- Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085) (← links)
- On the characterization of noninferior solutions of the vector optimization problem (Q1050907) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- General communication schemes for multiobjective decision making (Q1075941) (← links)
- A new look at fractional programming (Q1078093) (← links)
- Algorithms for nonlinear integer bicriterion problems (Q1114597) (← links)
- New approach for nonseparable dynamic programming problems (Q1117146) (← links)
- C-programming: A nonlinear parametric optimization method (Q1119478) (← links)
- Pareto optimal policies for harvesting with multiple objectives (Q1148233) (← links)
- Bicriteria linear fractional programming (Q1148820) (← links)
- Fractional programming: Applications and algorithms (Q1148821) (← links)
- Admissible points of a convex polyhedron (Q1157772) (← links)
- An algorithm for bicriterion linear programming (Q1163481) (← links)
- Efficiency and time-cost-tradeoffs in transportation problems (Q1169400) (← links)
- Bicriteria network flow problems: Continuous case (Q1175771) (← links)
- A parametric successive underestimation method for convex multiplicative programming problems (Q1200637) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- An interior penalty function method for the construction of efficient points in a multiple-criteria control problem (Q1214134) (← links)
- The set of all nondominated solutions in linear cases and a multicriteria simplex method (Q1220359) (← links)
- Vector maximization with two objective functions (Q1244175) (← links)
- On the characterization of Pareto-optimal solutions in bicriterion optimization (Q1245163) (← links)
- An interactive method as an aid in solving multi-objective mathematical programming problems (Q1249521) (← links)
- The structure of admissible points with respect to cone dominance (Q1250997) (← links)
- An interactive approach for vector optimization problems (Q1266670) (← links)
- System modeling and optimization under vector-valued criteria (Q1317187) (← links)
- Optimization over the efficient set: Four special cases (Q1321439) (← links)
- Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
- Efficient approximate representation of bi-objective tradeoff sets (Q1338659) (← links)
- Bicriteria and restricted 2-facility Weber problems (Q1362675) (← links)
- The biobjective minimum cost flow problem (Q1578006) (← links)
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program (Q1821694) (← links)
- Solving zero-one multiple objective programs through implicit enumeration (Q1835586) (← links)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
