The following pages link to Linear multiplicative programming (Q1207311):
Displaying 12 items.
- On jet-convex functions and their tensor products (Q2903151) (← links)
- A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming (Q2943839) (← links)
- (Q4266762) (← links)
- A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming (Q4632694) (← links)
- Duality for linear multiplicative programs (Q4673140) (← links)
- The Rank-One Quadratic Assignment Problem (Q5085471) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898) (← links)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
- A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
