Pages that link to "Item:Q5560788"
From MaRDI portal
The following pages link to Solving Bicriterion Mathematical Programs (Q5560788):
Displaying 28 items.
- Solving multiple-objective problems in the objective space (Q1918026) (← links)
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach (Q1937858) (← links)
- Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities (Q2114885) (← links)
- An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
- On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
- A branch-and-bound based method for solving monotone optimization problems (Q2501119) (← links)
- Parametric solution to the joint system identification and optimization problem (Q2560613) (← links)
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives (Q2563112) (← links)
- On jet-convex functions and their tensor products (Q2903151) (← links)
- A note on bicriterion programming (Q3040940) (← links)
- The range of the efficient frontier in multiple objective linear programming (Q3040942) (← links)
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh (Q3783056) (← links)
- On the characterization of efficient points by means of monotone functionals (Q3809595) (← links)
- Bicriteria bottleneck linear programming problem (Q3835630) (← links)
- Bibliography in fractional programming (Q3958287) (← links)
- Parameter-free convex equivalent and dual programs of fractional programming problems (Q4042856) (← links)
- Minimizing the sum of a convex function and the product of two affine functions over a convex set (Q4327904) (← links)
- Bicriterion integer linear fractional programs with parameters in the objective functions (Q4398551) (← links)
- Multiple objective programming with piecewise linear functions (Q4516915) (← links)
- On mean-standard deviation ratio problems and beyond via c-programming (Q4764591) (← links)
- Decomposition principle for indefinite quadratic programe (Q5650524) (← links)
- Problems and methods with multiple objective functions (Q5668271) (← links)
- Multiple objectives and non-separability in stochastic dynamic programming (Q5749148) (← links)
- Fractional programming (Q5893861) (← links)
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems (Q6162512) (← links)
