#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1999

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The aim of the paper is to present sequential methods for a pseudoconvex optimization problem whose objective function is the sum of a linear and a linear fractional function and the feasible region is a polyhedron, not necessarily compact. Since the sum of a linear and a linear fractional function is not in general pseudoconvex, we first derive conditions… (More)

- Laura Carosi, Laura Martein
- CEJOR
- 2008

In this paper we present a review of the main theoretical results obtained up to now in bicriterion fractional programming with few exceptions related to general results for bicriteria problems. With respect to sequential methods, we limit ourselves to present computational approaches for linear fractional problems.

- Riccardo Cambini, Laura Carosi, Laura Martein, Ezat Valipour
- Math. Meth. of OR
- 2017

We deal with a class of generalized fractional programming problems having a polyhedral feasible region and as objective the ratio of an affine function and the power p > 0 of an affine one. We aim to propose simplex-like sequential methods for finding the global maximum points. As the objective function may have local maximum points not global, we analyze… (More)

- Alberto Cambini, Laura Martein
- Encyclopedia of Optimization
- 2009

- Panos M. Pardalos, Konstantinos Karamanos, +18 authors Yu-Lin Tsai
- 2013

We present significant numerical evidence, based on the entropy analysis by lumping of the binary expansion of certain values of the Gamma function, that some of these values correspond to incompressible algorithmic information. In particular, the value corresponds to a peak of non-compressibility as anticipated on a priori grounds from number-theoretic… (More)

- ‹
- 1
- ›